Changes

Jump to: navigation, search

AliBaba

49 bytes added, 14:49, 26 June 2018
no edit summary
'''AliBaba''',<br/>
an experimental chess engine by [[Dennis Breuker]] written for testing various [[Transposition Table|hashing algorithms]] and [[Transposition Table#ReplacementStrategies|replacement schemes]] as subject of his Ph.D. thesis ''Memory versus Search in Games'' <ref>[[Dennis Breuker]] ('''1998'''). ''Memory versus Search in Games''. Ph.D. thesis, [[Maastricht University]], pdf via [http://www.dennisbreuker.nl/thesis/index.html Dennis Breuker's page]</ref>. With the permission of the author, a modified [[:Category:Open Source Engines|open source]] version was made available by [[Dann Corbit]] <ref>[https://www.stmintz.com/ccc/index.php?id=103729 Alibaba test bed (by Dennis Breuker)] by [[Dann Corbit]], [[CCC]], March 28, 2000</ref>, later adopted to [[WinBoard]] by [[Jim Ablett]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=25734 Alibaba (Dennis Breuker - 1995) with winboard support] by [[Jim Ablett]], [[CCC]], December 31, 2008</ref>. AliBaba uses a [[Vector Attacks#16x12|16x12 board]] and applies [[Principal Variation Search|PVS]] [[Alpha-Beta|alpha-beta]] with [[Late Move Reductions|late move reductions]] within the obligatory [[Iterative Deepening|iterative deepening]] framework with [[Aspiration Windows|aspiration windows]].
=See also=
'''[[Engines|Up one Level]]'''
[[Category:Open Source]]
[[Category:WinBoard]]

Navigation menu