scientific article; zbMATH DE number 6486247
From MaRDI portal
Publication:2947758
Recommendations
- Determinization and memoryless winning strategies
- Sure way to win a game using a mutually dependent decision progress model
- scientific article; zbMATH DE number 4152183
- Approximating the minimal lookahead needed to win infinite games
- Solving Games Without Determinization
- Efficient winning strategies in random-turn maker-breaker games
- Optimizing Winning Strategies in Regular Infinite Games
- Dynamic programming and board games: a survey
- A computational method for solving \(n\)-person game
Cited in
(4)- Using dynamic programming to determine an optimal strategy in a contract bridge tournament
- scientific article; zbMATH DE number 7626589 (Why is no real title available?)
- Sure way to win a game using a mutually dependent decision progress model
- A choice of strategy in nondeterministic antagonistic games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947758)