25,161
edits
Changes
no edit summary
=De Bruijn Network=
[[Zugzwang (Program)|Zugzwang's]] distributed [[Parallel Search|parallel search]] algorithm works for any underlying Transputer network, a [[De Bruijn sequenceSequence#DeBruijnGraphs|De Bruijn]] like connected network with maximum degree of 4 and a logarithmic [https://en.wikipedia.org/wiki/Distance_%28graph_theory%29 diameter] is well suited to serve a Transputer interconnection scheme <ref>[[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], page 6</ref> :
[[FILE:DeBruijnTransputer.JPG|none|border|text-bottom|480px]]
A [[De Bruijn Sequence#DeBruijnGraphs|De Bruijn]] like connected Transputer network of dimension three
=Chess Programs=
* [[Moby]]* [[Zugzwang (Program)|Zugzwang:Category:Transputer]]
=Publications=
