Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
The Turk
Edit
0
10
…
2
Tags
engines
namesake
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
Engines
* The Turk
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
[1]
,
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
[2]
and
Multi-Cut
[3]
.
The Turk
[4]
[5]
[6]
[7]
Table of Contents
Namesake
See also
Publications
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Namesake
The Turk
by
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.
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
).
Multi-cut Pruning in Alpha-Beta Search
.
CG 1998
Yngvi Björnsson
,
Tony Marsland
(
2001
).
Multi-cut Alpha-Beta Pruning in Game Tree Search
. Theoretical Computer Science, Vol. 252,
pdf
Forum Posts
Re: Computerised Chess Games
by
Valavan Manohararajah
,
rgcc
, April 07, 1997
External Links
Chess Engine
The Turk's ICGA Tournaments
Misc
The Turk from Wikipedia
, the historic fake chess-playing machine
Ein Türke in Paderborn
by
Mathias Feist
and
Karsten Bauermeister
,
ChessBase Nachrichten
, April 06, 2004 (German)
References
^
Games research group
^
Yngvi Björnsson
,
Tony Marsland
,
Jonathan Schaeffer
,
Andreas Junghanns
(
1997
).
Searching with Uncertainty Cut-offs.
ICCA Journal, Vol. 20, No. 1
^
Yngvi Björnsson
,
Tony Marsland
(
2001
).
Multi-cut Alpha-Beta Pruning in Game Tree Search
. Theoretical Computer Science, Vol. 252,
pdf
^
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
^
Wolfgang von Kempelen from Wikipedia
^
Johann Nepomuk Maelzel from Wikipedia
^
Maelzel's Chess Player from Wikipedia
What links here?
Page
Date Edited
Andreas Junghanns
Jun 26, 2017
APHID
Jun 26, 2017
Engines
Mar 10, 2018
Mathematician
Apr 9, 2018
Mr. Turk
Feb 21, 2015
Null Move Pruning
Dec 2, 2017
Raspberry Turk
Sep 7, 2017
The Turk
Apr 1, 2017
The Turk (TR)
Apr 1, 2017
Uncertainty Cut-Offs
Jul 21, 2015
University of Alberta
Feb 20, 2018
Who's Who
Sep 6, 2017
WMCCC 1996
Sep 15, 2016
Yngvi Björnsson
Jun 26, 2017
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
an experimental chess program developed in the mid 90s by two students of the University of Alberta and members of the Games research group [1], 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 [2] and Multi-Cut [3] .
Table of Contents
Namesake
See also
Publications
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Up one level