This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

The Turk

Home * Engines * The Turk

The Turk 1 2 3 4The Turk 1 2 3 4


  1. Copper engraving from the book: Karl Gottlieb von Windisch (1783). Briefe über den Schachspieler von Kempelen nebst drey Kupferstichen die diese berühmte Maschine vorstellen. The Turk from Wikipedia↩︎
  2. Wolfgang von Kempelen from Wikipedia↩︎
  3. Johann Nepomuk Maelzel from Wikipedia↩︎
  4. Maelzel's Chess Player from Wikipedia↩︎

The Turk,
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 Jakarta. It uses NegaScout and also includes most search enhancement found in contemporary chess programs, such as extensions, quiescence search, and transposition table. Move ordering considers captures in MVV-LVA order, and the history heuristic is used to sort the remaining moves. The 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 techniques such as Uncertainty Cut-Offs 1 and Multi-Cut 2 .

Contents
  1. Namesake
  2. See also
  3. Publications
  4. Forum Posts
  5. External Links
    1. Chess Engine
    2. Misc
  6. References

Namesake

See also

Publications

Forum Posts

Chess Engine

Misc

References

Up one level


  1. Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. ICCA Journal, Vol. 20, No. 1↩︎

  2. Yngvi Björnsson, Tony Marsland (2001). Multi-cut Alpha-Beta Pruning in Game Tree Search. Theoretical Computer Science, Vol. 252, pdf↩︎

Categories: Experimental · Namesake

What links here

Contributors: GerdIsenberg.