Games solved: Now and in the future
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696545 (Why is no real title available?)
- scientific article; zbMATH DE number 988826 (Why is no real title available?)
- scientific article; zbMATH DE number 988828 (Why is no real title available?)
- scientific article; zbMATH DE number 988841 (Why is no real title available?)
- scientific article; zbMATH DE number 988844 (Why is no real title available?)
- scientific article; zbMATH DE number 3839732 (Why is no real title available?)
- scientific article; zbMATH DE number 3713198 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 43078 (Why is no real title available?)
- scientific article; zbMATH DE number 46977 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 1944401 (Why is no real title available?)
- scientific article; zbMATH DE number 1944404 (Why is no real title available?)
- scientific article; zbMATH DE number 1759677 (Why is no real title available?)
- scientific article; zbMATH DE number 1759688 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- A computer assisted study of Go on \(M \times N\) boards
- A hierarchical approach to computer Hex
- A solution to the GHI problem for best-first search
- Best-first fixed-depth minimax algorithms
- Computers and games. 2nd international conference, CG 2000, Hamamatsu, Japan, October 26--28, 2000. Revised papers
- Conspiracy numbers for min-max search
- Depth-first iterative-deepening: An optimal admissible tree search
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Linear-space best-first search
- Proof-number search
- Qubic: 4 × 4 × 4 Tic-Tac-Toe
- Solving \(8\times 8\) Domineering
- The Game of Hex and the Brouwer Fixed-Point Theorem
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi
- World-championship-caliber Scrabble*
Cited in
(19)- On solving the 7,7,5-game and the 8,8,5-game
- One approach to solution of complex game problems
- Dependency-based search for Connect6
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
- Application of reinforcement learning to the game of Othello
- Polymerization and crystallization of snowflake molecules in Domineering
- A heuristic approach to domino grid problem
- Checkers is solved
- New results for Domineering from combinatorial game theory endgame databases
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Solving games dependence of applicable solving procedures
- Impartial games: a challenge for reinforcement learning
- OUTCOME UNCERTAINTY AND INTERESTEDNESS IN GAME-PLAYING: A CASE STUDY USING SYNCHRONIZED HEX
- Drawn k-in-a-row games
- BEST PLAY IN FANORONA LEADS TO DRAW
- On the fairness and complexity of generalized \(k\)-in-a-row games
- A Retrograde Approximation Algorithm for Multi-player Can’t Stop
- Selecting evaluation functions in opponent-model search
- scientific article; zbMATH DE number 6096477 (Why is no real title available?)
This page was built for publication: Games solved: Now and in the future
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958209)
