25,161
edits
Changes
no edit summary
His Mini Go Solver ''Migos'' solved 5x5 Go in 2002 <ref>[http://erikvanderwerf.tengen.nl/5x5/5x5solved.html 5x5 Go is solved] October 20,2002</ref>,
using [[Iterative Deepening|iterative deepening]] [[Alpha-Beta|alpha-beta]] search ([[Principal Variation Search|PVS]]), with [[Transposition Table|transposition tables]], [[Enhanced Transposition Cutoff|enhanced transposition cut-offs]],
two [[Killer Move|killer moves]], [[History Heuristic|history heuristic]], Benson's algorithm for unconditional [https://en.wikipedia.org/wiki/Life_and_death live] <ref>[https://senseis.xmp.net/?BensonsDefinitionOfUnconditionalLife%2FVersion20100208 Benson's Definition of Unconditional Life / Version 20100208 at Sensei's Library]</ref> <ref>[[David B. Benson]] ('''1976'''). ''Life in the Game of Go''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 10, [https://webdocs.cs.ualberta.ca/~games/go/seminar/2002/020717/benson.pdf pdf]</ref>, and domain specific evaluation heuristics, futher elaborated in his Ph.D. thesis and [[ICGA Journal]] papers.
=Selected Publications=
