Admissible moves in two-player games

DOI10.1007/3-540-45622-8_5MaRDI QIDQ4737578zbMATH OpenFDO

Authors Tristan Cazenave

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2371/23710052.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) 2-person games (91A05) Applications of game theory (91A80)

Recommendations

• Abstract proof search
• Applying adversarial planning techniques to Go
• scientific article; zbMATH DE number 67799
• scientific article; zbMATH DE number 269837
• A theory of heuristic information in game-tree search

Cited in

(5)

• Allowing two moves in succession increases the game's bias: A theorem
• scientific article; zbMATH DE number 7219399 (Why is no real title available?)
• Phutball is PSPACE-hard
• Plausible move generation using move merit analysis with cut-off thresholds in Shogi
• Theory of Moves

This page was built for publication: Admissible moves in two-player games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737578)