Changes

Jump to: navigation, search

DarkThought

986 bytes added, 17:46, 26 December 2019
no edit summary
from the [[ICGA]] page <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=15 Dark Thought's ICGA Tournaments]</ref>
==1995==
Dark Thought is a [[Brute-Force|brute-force]] program employing sophisticated [[Move Ordering|move ordering techniques]] and [[Extensions|search extensions]] backed by a selective [[Quiescence Search|quiescence search]]. On a [[DEC Alpha#3000|DEC 3000-600]] (175Mhz [[DEC Alpha|Alpha 21064 CPU]], 64MB [[Memory#RAM|RAM]]) Dark Thought visits up to 60,000 [[Nodes per secondSecond|nodes per second]] and reaches a non-selective, brute-force search [[Depth|depth]] of at least 8 [[Ply|plies]] in 1 minute. Its [[Opening Book|opening book]] contains 250,000 positions. On-line access to [[Thompson's Databases|Thompson's endgame databases]] is handled by a greatly enhanced version of the public domain software by Beuckens and Hoekstra. Peter Gillgasch, the main brain behind the chess engine, wrote a prototype version of Dark Thought in [[Pascal]] in 1992.
Today the program compiles and runs from the same [[C|ANSI C]] source files on a variety of platforms. Markus Gille and Ernst Heinz are responsible for fine-tuning the [[Evaluation|evaluation]] function and databases and Peter Gillagasch still maintains the chess engine. During the [[WCCC 1995|World Championships]], Darkthought will run on the most powerful DEC Alpha workstation available.
=See also=
* [[Various Classifications#:Category:Demonology|Demonology]]* [[Various Classifications#:Category:Thought|Thought]]
=Publications=
* [[Ernst A. Heinz]] ('''1997'''). ''[http://people.csail.mit.edu/heinz/dt/node2.html How DarkThought Plays Chess].'' [[ICGA Journal#20_3|ICCA Journal, Vol. 20, No. 3]]
* [[Ernst A. Heinz]] ('''1998'''). ''[http://people.csail.mit.edu/heinz/dt/node46.html DarkThought Goes Deep].'' [[ICGA Journal#21_4|ICCA Journal, Vol. 21, No. 4]]
* [[Ernst A. Heinz]] ('''1999'''). ''[http://people.csail.mit.edu/heinz/node1.html#scale-cchess Scalable Search in Computer Chess]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann Morgan Kaufmann], [https://de.wikipedia.org/wiki/Vieweg_Verlag Vieweg-Verlag], [https://link.springer.com/book/10.1007/978-3-322-90178-1 Springer Link] <ref>[[Dap Hartmann]] ('''2000'''). ''[http://ilk.uvt.nl/icga/journal/contents/content23-1.htm#THE%20IMPORTANCE%20OF%20BEING%20SCALABLE The Importance of being Scalable]''. [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]], Review</ref> <ref>[[Chrilly Donninger]] ('''2000'''). ''Die Wissenschaft kehrt zurück - Computerschach-Forschung und das Buch von Ernst Heinz''. [[Computerschach und Spiele|CSS]] 2/00, [http://www.mustrum.de/chrilly/heinz.pdf pdf] (German)</ref>
: [[FILE:ScalableSearch.jpg|none|border|200px|text-bottom|link=https://link.springer.com/book/10.1007/978-3-322-90178-1]]
* [[Ernst A. Heinz]] ('''2001'''). ''Modeling the “Go Deep” Behaviour of CRAFTY and DARK THOUGHT.'' [[Advances in Computer Games 9]]
* [[Ernst A. Heinz]] ('''2001'''). ''Selected Goodies of DarkThought''. Invited Lecture, [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]], [https://ilk.uvt.nl/icga/news/Olympiad/Olympiad/workshop/InvitedLecture-Heinz.ppt ppt]
'''[[Engines|Up one level]]'''
[[Category:DEC Alpha]]
[[Category:SPARC]]
[[Category:Wassily Kandinsky]]
[[Category:Van der Graaf Generator]]
[[Category:Demonology]]
[[Category:Thought]]

Navigation menu