Games solved: Now and in the future

DOI10.1016/S0004-3702(01)00152-7zbMath0982.68143DBLPjournals/ai/HerikUR02OpenAlexW1994685255WikidataQ55918856 ScholiaQ55918856MaRDI QIDQ5958209

H. Jaap van den Herik, Jos W. H. M. Uiterwijk, Jack van Rijswijck

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00152-7

zbMATH Keywords

knowledge-based methodsbrute-force methodsgame characteristicsinitiativesearch methodssolving games

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (14)

Polymerization and crystallization of snowflake molecules in Domineering ⋮ Dependency-Based Search for Connect6 ⋮ A heuristic approach to domino grid problem ⋮ Drawn \(k\)-in-a-row games ⋮ On the fairness and complexity of generalized \(k\)-in-a-row games ⋮ Application of reinforcement learning to the game of Othello ⋮ New results for Domineering from combinatorial game theory endgame databases ⋮ A Retrograde Approximation Algorithm for Multi-player Can’t Stop ⋮ On solving the 7,7,5-game and the 8,8,5-game ⋮ OUTCOME UNCERTAINTY AND INTERESTEDNESS IN GAME-PLAYING: A CASE STUDY USING SYNCHRONIZED HEX ⋮ PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH ⋮ BEST PLAY IN FANORONA LEADS TO DRAW ⋮ Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction ⋮ Selecting evaluation functions in opponent-model search

Cites Work

• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Conspiracy numbers for min-max search
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Proof-number search
• A solution to the GHI problem for best-first search
• Solving \(8\times 8\) Domineering
• A computer assisted study of Go on \(M \times N\) boards
• Best-first fixed-depth minimax algorithms
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Qubic: 4 × 4 × 4 Tic-Tac-Toe
• A Combinatorial Problem Which Is Complete in Polynomial Space
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• A hierarchical approach to computer Hex
• World-championship-caliber Scrabble*
• Computers and games. 2nd international conference, CG 2000, Hamamatsu, Japan, October 26--28, 2000. Revised papers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Games solved: Now and in the future