25,161
edits
Changes
no edit summary
==Depth-First Search==
[[Depth-First]] search starts at the root and explores as far as possible along each branch before backtracking. Memory requirements are moderate, since only one path from the root to one leaf is kept in memory. The giga bytes of [[Memory#RAM|RAM]] in recent computers is utilized by a [[Transposition Table|transposition table]]. Minimax and Negamax are mentioned for educational reasons as the prototypes for the more advanced algorithms. They otherwise have no practical relevance in software, except traversing a minimax tree inside a [[Perft|perft]] framework for [[Engine Testing|testing]] the [[Move generationGeneration|move generator]]. Depth-first algorithms are generally embedded inside an [[Iterative Deepening|iterative deepening]] framework for [[Time Management|time control]] and [[Move Ordering|move ordering]] issues.
* [[Minimax]]
* [[Negamax]]
* [[Jeff Rollason]] ('''2014'''). ''[http://www.aifactory.co.uk/newsletter/2014_01_interest_minimax.htm Interest Search - Another way to do Minimax]''. [[AI Factory]], Summer 2014
* [[Tom Holden]] ('''2014'''). ''Notes on an alternative approach to move choice in games such as Chess''. [http://www.tholden.org/wp-content/uploads/2014/11/Notes-on-an-alternative-approach-to-move-choice-in-games-such-as-Chess.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54324 A new algorithm accounting for the uncertainty in eval funcs] by [[Tom Holden]], [[CCC]], November 12, 2014</ref>
* [[Christopher D. Rosin]] ('''2014'''). ''Game playing''. [https://en.wikipedia.org/wiki/Wiley_Interdisciplinary_Reviews:_Cognitive_Science WIREs Cognitive Science], Vol. 5, [http://www.chrisrosin.com/Rosin-Game-Playing-submitted-ver.pdf pdf preprint]
==2015 ...==
* [[Jakub Pawlewicz]], [[Ryan Hayward]] ('''2015'''). ''Feature Strength and Parallelization of Sibling Conspiracy Number Search''. [[Advances in Computer Games 14]]
