Experiments With Some Programs That Search Game Trees
Journal of the ACM (JACM)
Computer Chess
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
The History Heuristic and Alpha-Beta Search Enhancements in Practice
IEEE Transactions on Pattern Analysis and Machine Intelligence
Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Machines that learn to play games
Application of the killer-tree heuristic and the lambda-search method to lines of action
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Heuristic search and computer game playing III
An effective two-level proof-number search algorithm
Theoretical Computer Science - Algorithmic combinatorial game theory
Genetic algorithms for mentor-assisted evaluation function optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computer recognition of aesthetics in a zero-sum perfect information game
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
CG '08 Proceedings of the 6th international conference on Computers and Games
Advanced computer recognition of aesthetics in the game of chess
WSEAS Transactions on Computers
Simulating human grandmasters: evolution and coevolution of evaluation functions
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
RankCut: a domain independent forward pruning method for games
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
The X-0-0 heuristic in game tree analysis
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Relative efficiency of alpha-beta implementations
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Information Sciences: an International Journal
CHANCEPROBCUT: forward pruning in chance nodes
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Expert-driven genetic algorithms for simulating evaluation functions
Genetic Programming and Evolvable Machines
Improving Monte-Carlo tree search in Havannah
CG'10 Proceedings of the 7th international conference on Computers and games
Automatic generation of search engines
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Building a world-champion arimaa program
CG'04 Proceedings of the 4th international conference on Computers and Games
The relative history heuristic
CG'04 Proceedings of the 4th international conference on Computers and Games
Searching with partial belief states in general games with incomplete information
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
An algorithm is presented for obtaining the principal continuation in trees searched by two-person game playing programs based on the Alpha-Beta algorithm. Moves saved while determining the principal continuation are shown to be good candidates for killer moves when the killer heuristic supplements the Alpha-Beta search.