Artificial Intelligence
The PN -search algorithm: application to tsume-shogi
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
An effective two-level proof-number search algorithm
Theoretical Computer Science - Algorithmic combinatorial game theory
Search versus knowledge for solving life and death problems in Go
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
About the Completeness of Depth-First Proof-Number Search
CG '08 Proceedings of the 6th international conference on Computers and Games
Job-level proof-number search for connect6
CG'10 Proceedings of the 7th international conference on Computers and games
Evaluation-function based proof-number search
CG'10 Proceedings of the 7th international conference on Computers and games
Randomized parallel proof-number search
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Bitboard knowledge base system and elegant search architectures for Connect6
Knowledge-Based Systems
| Hi-index | 0.00 |
Various efficient game problem solvers are based on PN-Search. Especially depth-first versions of PN-Search like DF-PN or PDS - contrary to other known techniques - are able to solve really hard problems. However, the performance of DF-PN and PDS decreases drastically when the search space significantly exceeds the available memory. A straightforward enhancement trick to overcome this problem is presented. Experiments on Atari Go and Lines of Action show great practical value of the proposed enhancement.