25,161
edits
Changes
Created page with "'''Home * Engines * The Turk''' FILE:Tuerkischer schachspieler windisch4.jpg|border|right|thumb| The Turk <ref>Copper engraving from the book: [https://en..."
'''[[Main Page|Home]] * [[Engines]] * The Turk'''
[[FILE:Tuerkischer schachspieler windisch4.jpg|border|right|thumb| The Turk <ref>Copper engraving from the book: [https://en.wikipedia.org/wiki/Karl_Gottlieb_von_Windisch Karl Gottlieb von Windisch] ('''1783'''). ''Briefe über den Schachspieler [https://en.wikipedia.org/wiki/Wolfgang_von_Kempelen von Kempelen] nebst drey Kupferstichen die diese berühmte Maschine vorstellen''. [https://en.wikipedia.org/wiki/The_Turk The Turk from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Wolfgang_von_Kempelen Wolfgang von Kempelen from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Johann_Nepomuk_Maelzel Johann Nepomuk Maelzel from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Maelzel%27s_Chess_Player Maelzel's Chess Player from Wikipedia]</ref> ]]
'''The Turk''',<br/>
an experimental chess program developed in the mid 90s by two students of the [[University of Alberta]] and members of the ''Games research group'', [[Yngvi Björnsson]] and [[Andreas Junghanns]], which competed the [[WMCCC 1996]] in [https://en.wikipedia.org/wiki/Jakarta Jakarta].
It uses [[NegaScout]] and also includes most search enhancement found in contemporary chess programs, such as [[Extensions|extensions]], [[Quiescence Search|quiescence search]], and [[Transposition Table|transposition table]]. [[Move Ordering|Move ordering]] considers [[Captures|captures]] in [[MVV-LVA]] order, and the [[History Heuristic|history heuristic]] is used to sort the remaining moves. The [[Best Move|best move]] previously found in a position is stored in the transposition table and searched first where applicable. The Turk was test-bed of various [[Pruning|pruning techniques]] such as [[Uncertainty Cut-Offs]] <ref>[[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs.'' [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]</ref> and [[Multi-Cut]] <ref> [[Yngvi Björnsson]], [[Tony Marsland]] ('''2001'''). ''Multi-cut Alpha-Beta Pruning in Game Tree Search''. Theoretical Computer Science, Vol. 252, [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01a.pdf pdf]</ref> .
=Namesake=
* [[The Turk (TR)|The Turk]] by [[Yakup Ipek|Yakup İpek]]
=See also=
* [[Kempelen]]
* [[Mr. Turk]]
* [[Multi-Cut]]
* [[Raspberry Turk]]
* [[The Baron]]
* [[Uncertainty Cut-Offs]]
* [[WMCCC 1996]]
=Publications=
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs.'' [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs''. [[Advances in Computer Chess 8]]
* [[Yngvi Björnsson]], [[Tony Marsland]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_2 Multi-cut Pruning in Alpha-Beta Search]''. [[CG 1998]]
* [[Yngvi Björnsson]], [[Tony Marsland]] ('''2001'''). ''Multi-cut Alpha-Beta Pruning in Game Tree Search''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 252, [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01a.pdf pdf]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/URzYvWVd-G0/ml1_vAf9yBAJ Re: Computerised Chess Games] by [[Valavan Manohararajah]], [[Computer Chess Forums|rgcc]], April 07, 1997
=External Links=
==Chess Engine==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=199 The Turk's ICGA Tournaments]
==Misc==
* [https://en.wikipedia.org/wiki/The_Turk The Turk from Wikipedia], the historic fake chess-playing machine
* [https://de.chessbase.com/post/ein-trke-in-paderborn Ein Türke in Paderborn] by [[Mathias Feist]] and [[Karsten Bauermeister]], [[ChessBase|ChessBase Nachrichten]], April 06, 2004 (German)
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Experimental]]
[[Category:Namesake]]
[[FILE:Tuerkischer schachspieler windisch4.jpg|border|right|thumb| The Turk <ref>Copper engraving from the book: [https://en.wikipedia.org/wiki/Karl_Gottlieb_von_Windisch Karl Gottlieb von Windisch] ('''1783'''). ''Briefe über den Schachspieler [https://en.wikipedia.org/wiki/Wolfgang_von_Kempelen von Kempelen] nebst drey Kupferstichen die diese berühmte Maschine vorstellen''. [https://en.wikipedia.org/wiki/The_Turk The Turk from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Wolfgang_von_Kempelen Wolfgang von Kempelen from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Johann_Nepomuk_Maelzel Johann Nepomuk Maelzel from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Maelzel%27s_Chess_Player Maelzel's Chess Player from Wikipedia]</ref> ]]
'''The Turk''',<br/>
an experimental chess program developed in the mid 90s by two students of the [[University of Alberta]] and members of the ''Games research group'', [[Yngvi Björnsson]] and [[Andreas Junghanns]], which competed the [[WMCCC 1996]] in [https://en.wikipedia.org/wiki/Jakarta Jakarta].
It uses [[NegaScout]] and also includes most search enhancement found in contemporary chess programs, such as [[Extensions|extensions]], [[Quiescence Search|quiescence search]], and [[Transposition Table|transposition table]]. [[Move Ordering|Move ordering]] considers [[Captures|captures]] in [[MVV-LVA]] order, and the [[History Heuristic|history heuristic]] is used to sort the remaining moves. The [[Best Move|best move]] previously found in a position is stored in the transposition table and searched first where applicable. The Turk was test-bed of various [[Pruning|pruning techniques]] such as [[Uncertainty Cut-Offs]] <ref>[[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs.'' [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]</ref> and [[Multi-Cut]] <ref> [[Yngvi Björnsson]], [[Tony Marsland]] ('''2001'''). ''Multi-cut Alpha-Beta Pruning in Game Tree Search''. Theoretical Computer Science, Vol. 252, [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01a.pdf pdf]</ref> .
=Namesake=
* [[The Turk (TR)|The Turk]] by [[Yakup Ipek|Yakup İpek]]
=See also=
* [[Kempelen]]
* [[Mr. Turk]]
* [[Multi-Cut]]
* [[Raspberry Turk]]
* [[The Baron]]
* [[Uncertainty Cut-Offs]]
* [[WMCCC 1996]]
=Publications=
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs.'' [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] ('''1997'''). ''Searching with Uncertainty Cut-offs''. [[Advances in Computer Chess 8]]
* [[Yngvi Björnsson]], [[Tony Marsland]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_2 Multi-cut Pruning in Alpha-Beta Search]''. [[CG 1998]]
* [[Yngvi Björnsson]], [[Tony Marsland]] ('''2001'''). ''Multi-cut Alpha-Beta Pruning in Game Tree Search''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 252, [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01a.pdf pdf]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/URzYvWVd-G0/ml1_vAf9yBAJ Re: Computerised Chess Games] by [[Valavan Manohararajah]], [[Computer Chess Forums|rgcc]], April 07, 1997
=External Links=
==Chess Engine==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=199 The Turk's ICGA Tournaments]
==Misc==
* [https://en.wikipedia.org/wiki/The_Turk The Turk from Wikipedia], the historic fake chess-playing machine
* [https://de.chessbase.com/post/ein-trke-in-paderborn Ein Türke in Paderborn] by [[Mathias Feist]] and [[Karsten Bauermeister]], [[ChessBase|ChessBase Nachrichten]], April 06, 2004 (German)
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Experimental]]
[[Category:Namesake]]
