Changes

Jump to: navigation, search

Zugzwang (Program)

141 bytes added, 09:35, 6 July 2021
no edit summary
'''[[Main Page|Home]] * [[Engines]] * Zugzwang'''
'''Zugzwang''' was a massive parallel chess program by [[Rainer Feldmann]] and [[Peter Mysliwietz]] from the [[Paderborn University]], Germany. It won the bronze medal at the [[2nd Computer Olympiad#Chess|2nd Computer Chess Olympiad, London 1990]], and was runner up with three wins and two draws at the [[WCCC 1992]], and won three times the International Paderborn Computer Chess Championships [[IPCCC]]. The Zugzwang team was completed by chess player and [[:Category:Opening Book AuthorsAuthor|opening book author]] [[Heiner Matthias]]. Zugzwang was first based on [[Transputer]] technology with a grid of up to 1024 [https://en.wikipedia.org/wiki/Inmos Inmos] T800 and later T805 processors. Software was developed in the [https://en.wikipedia.org/wiki/Occam_%28programming_language%29 Occam] programming language. Later it was also ported to the [[C|C-programming language]], to run on other hardware architectures such as the [[Cray T3E]] supercomputer in 1999. The [[Young Brothers Wait Concept]] was elaborated exhaustingly by Feldmann et al. <ref>[[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]</ref><ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems'' Phd-Thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref>. Zugzwang didn't use [[Null Move Pruning]], but Feldmann's [[Fail-High Reductions]] as well based on the [[Null Move Observation]] <ref>[[Rainer Feldmann]] ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]</ref>. Zugzwang's [[Evaluation|evaluation]] was [[Automated Tuning|tuned]] by [[Simulated Annealing|simulated annealing]] as described in Mysliwietz' Ph.D. thesis <ref> [[Peter Mysliwietz]] ('''1994'''). ''Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.'' Ph.D. thesis (German) </ref>.
=Photos & Games=
given from the [[ICGA]] tournament site <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=54 Zugzwang's ICGA Tournaments]</ref>:
==1995==
Zugzwang made its first moves in 1989. It won the bronze medal in the 1990 Computer Olympiad, and won the Paderborn (human) Championships in 1991. In the last [[WCCC 1992|Computer World Championships in Madrid 1992]], Zugzwang, running on a system consisting of 1023 T800 transputers, finished second and was undefeated without playing the eventual Champion, [[ChessMachine|ChessMachine Schroeder]]. In 1993 Zugzwang had its first victory over a grandmaster. In 1994 Zugzwang was completely rewritten from OCCAM to C (about 20,000 lines of code) and is now portable to a large spectrum of machines including [[SPARC]], SGI, [[DEC Alpha]], [[i860]], [[x86|486]] and [[PowerPC]]. In this year's Championships, Zugzwang will run on a GC-Powerplus distributed system (based on the PowerPC) with at least 96 processors. The [[Opening Book|opening book]] contains about 130,000 moves and 1MB [[Transposition Table|transposition tables]] are used per processor. Zugzwang uses [[Brute-Force|brute-force]] [[Alpha-Beta|alpha-beta]] search with [[History Heuristic|history tables]] and [[Killer Heuristic|killer heuristics]]. The program searches about 3000 [[Nodes per secondSecond|nodes per second]] per processor on a PowerPC. The search is performed by distributed processors using a distributed algorithm based on the [[Young Brothers Wait Concept]], which gives good results even if as many as 1000 processors are used. In this case the system calculates moves more than 400 times faster than a sequential system.
==1999==
The most recent tournament played was the Lippstadt Grandmaster Tournament in August 1998, where the program finished second and played at a rate of about 2600 ELO points. The program ran on a Cray T3E with 512 processors (300 MHz) at the [https://en.wikipedia.org/wiki/Forschungszentrum_J%C3%BClich John von Neumann Institute for Computing] <ref>[http://fzj.helmholtz.de/nic/nic-e.html John von Neumann Institute for Computing]</ref> in [https://en.wikipedia.org/wiki/J%C3%BClich Juelich], Germany.
 
=See also=
* [[Alpha I]]
* [[Zugzwang]]
=Publications=
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1989'''). ''Distributed Game-Tree Search''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Comment on 'Distributed Game-Tree Search'''. [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]]</ref>
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1992'''). ''Experiments with a Fully Distributed Chess Program''. [[3rd Computer Olympiad#Workshop|Heuristic Programming in AI 3]]
=References=
<references />
 
'''[[Engines|Up one Level]]'''
[[Category:Mainframe]]
[[Category:Transputer]]
[[Category:PowerPC]]
[[Category:DEC Alpha]]

Navigation menu