Los Alamos chess game 2 (after P-K3) is solved; black wins in 21 moves.
Roger A. SaylePublished in: J. Int. Comput. Games Assoc. (2023)
Keyphrases
- game tree
- game playing
- game tree search
- alpha beta search
- imperfect information
- two player games
- evaluation function
- board game
- computer chess
- search algorithm
- learning objects
- monte carlo tree search
- games played
- monte carlo
- tree search
- video games
- perfect information
- human players
- general game playing
- game theoretic
- artificial intelligence
- optimal strategy
- minimax search
- metadata
- game based learning
- neural network
- computer games
- game design
- game play
- connected components
- game theory
- learning experience
- np hard