25,161
edits
Changes
Created page with "'''Home * Engines * ChessBrain''' FILE:Internet map 1024 - transparent, inverted.png|border|right|thumb|240px| Partial map of the Internet <ref>Partial m..."
'''[[Main Page|Home]] * [[Engines]] * ChessBrain'''
[[FILE:Internet map 1024 - transparent, inverted.png|border|right|thumb|240px| Partial map of the Internet <ref>Partial map of the [https://en.wikipedia.org/wiki/Internet Internet] based on the January 15, 2005 data found on [http://www.opte.org/maps/ opte.org]. Each line is drawn between two nodes, representing two [https://en.wikipedia.org/wiki/IP_address IP addresses]. The length of the lines are indicative of the delay between those two nodes. This graph represents less than 30% of the [https://en.wikipedia.org/wiki/Classful_network Class C] networks reachable by the data collection program in early 2005. Lines are color-coded according to their corresponding [https://tools.ietf.org/html/rfc1918 RFC 1918], Original upload: December 1, 2006, [http://www.opte.org/ The Opte Project], [https://creativecommons.org/licenses/by/2.5/deed.en CC BY 2.5], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''ChessBrain''',<br/>
a chess playing entity inspired by the [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing] project [https://en.wikipedia.org/wiki/SETI@home SETI@home], consisting of a virtual chess supercomputer of over 2000 [https://en.wikipedia.org/wiki/Internet internet] connected machines running the [[Beowulf]] [[:Category:Open Source|open source chess engine]] <ref>[http://www.frayn.net/beowulf/ Beowulf Computer Chess Home Page]</ref>. The project was headed by [[Carlos Justiniano]], who wrote much of the networking infrastructure, and [[Colin Frayn]], who was responsible for the chess side of things <ref>[http://frayn.net/blog/?p=662 Col’s Rational World » Blog Archive » ChessBrain]</ref>, with many voluntary computer chess developers and even more aficionados contributing in improving and testing the program, or in providing processing resources. After the presentation of '''ChessBrain II''' in 2006 and first tests <ref>[http://chessbrain.net/ ChessBrain]</ref>, the ChessBrain project was abandoned.
=Description=
ChessBrain's <ref>Description based on: [[Colin Frayn]], [[Carlos Justiniano]], [[Kevin Lew]] ('''2006'''). ''ChessBrain II – A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation''. [http://www.chessbrain.net/docs/chessbrainII.pdf pdf]</ref> core [[Parallel Search|distributed search]] uses the [[APHID]] algorithm <ref>[[Mark Brockington]], [[Jonathan Schaeffer]] ('''1996'''). ''The APHID Parallel αβ Search Algorithm''. Technical Report 96-07, Department of Computing Science, [[University of Alberta]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.8215&rep=rep1&type=pdf pdf] from [https://en.wikipedia.org/wiki/CiteSeerX CiteSeerX]</ref> <ref>[[Mark Brockington]] ('''1998'''). ''Asynchronous Parallel Game-Tree Search''. Ph.D. Thesis, [[University of Alberta]], [http://www.collectionscanada.gc.ca/obj/s4/f2/dsk2/ftp02/NQ29023.pdf pdf]</ref>. It performs [[Iterative Deepening|iterative deepening]] firstly locally on the [https://en.wikipedia.org/wiki/Server_(computing) server] and after a certain fixed time, with new [[Leaf Node|leaf nodes]] being distributed as '''work units''' to [https://en.wikipedia.org/wiki/Peer-to-peer peer nodes] of a [https://en.wikipedia.org/wiki/Beowulf_cluster Beowulf cluster]. Work units encode [[Chess Position|position]] and [[Depth|search depth]] to be analyzed, distributed to the connected peer nodes on a request basis, also ranked by estimated complexity using extrapolation from their recorded complexity at previous, shallower depths, to implement [https://en.wikipedia.org/wiki/Load_balancing_(computing) load balancing] accordant to the peer nodes' performances. In case of a [[Fail-High|fail-high]] of its parent node, pending child peer nodes receive an abort signal to immediately return and retrieve a new work unit.
'''ChessBrain I''' used a [https://en.wikipedia.org/wiki/Supernode_(networking) supernode] to handle the remote coordination of hundreds of machines, using [https://en.wikipedia.org/wiki/XML XML] first via [https://en.wikipedia.org/wiki/XML-RPC XML-RPC], and later [https://en.wikipedia.org/wiki/SOAP SOAP], [https://en.wikipedia.org/wiki/Data_compression compressed] using [https://en.wikipedia.org/wiki/Zlib ZLib] and then encrypted using the [https://en.wikipedia.org/wiki/Advanced_Encryption_Standard AES Rijndael cipher] <ref>[[Mathematician#JDaemen|Joan Daemen]], [[Mathematician#VRijmen|Vincent Rijmen]] ('''1999'''). ''The Rijndael Block Cipher''. AES Proposal, [http://www.cryptosoft.de/docs/Rijndael.pdf pdf]</ref>.
With '''ChessBrain II''', jobs are distributed from a central server to remote [https://en.wikipedia.org/wiki/Computer_cluster cluster] nodes, which in turn manage local communities of peer nodes. Initially considering the [https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing Berkeley Open Infrastructure for Network Computing], which was designed with a [https://en.wikipedia.org/wiki/Client%E2%80%93server_model client–server model] in mind, the [https://en.wikipedia.org/wiki/Peer-to-peer peer-to-peer] requirements for ChessBrain II lead to the development of an own [https://en.wikipedia.org/wiki/Message message] [https://en.wikipedia.org/wiki/Courier courier] [https://en.wikipedia.org/wiki/Application_server application server], dubbed msgCourier, also published as [https://en.wikipedia.org/wiki/Source_code open source] <ref>[https://sourceforge.net/projects/msgcourier/ msgCourier download | SourceForge.net]</ref>.
=Guinness World Record=
<span id="game"></span>On January 30, 2004, ChessBrain played a game versus [https://en.wikipedia.org/wiki/Peter_Heine_Nielsen Peter Heine Nielsen] at [https://en.wikipedia.org/wiki/Symbion_Science_Park Symbion Science Park], [https://en.wikipedia.org/wiki/Copenhagen Copenhagen], [https://en.wikipedia.org/wiki/Denmark Denmak], which ended in draw. The game was an attempt of a [https://en.wikipedia.org/wiki/Guinness_World_Records Guinness World Record] for the largest number of computers used to play one single game of chess <ref>[http://www.guinnessworldrecords.com/world-records/largest-networked-chess-computer/ Largest networked chess computer | Guinness World Records]</ref>, on the ChessBrain site annotated by Nielsen and [[Eric Schiller]] <ref>[http://chessbrain.net/games.html ChessBrain - Game Commentary]</ref>.
<pre>
[Event "ChessBrain World Record Attempt"]
[Site "Copenhagen Denmark, Symbion Science Park"]
[Date "2004.1.30"]
[Round "1"]
[White "Peter Heine Nielsen"]
[Black "ChessBrain"]
[Result "1/2-1/2"]
1.d4 g6 2.c4 Bg7 3.e4 d6 4.Nc3 Nf6 5.Nf3 O-O 6.Be2 e5 7.O-O a5 8.Re1 exd4
9.Nxd4 Bd7 10.Bg5 Nc6 11.Nxc6 Bxc6 12.f3 Qd7 13.Qd2 Rfe8 14.Rac1 h5
15.Kh1 Nh7 16.Bh6 Bxh6 17.Qxh6 Re5 18.Nd5 Rae8 19.Qd2 b6 20.Bd3 Qd8
21.Rf1 Nf6 22.b3 Bb7 23.Qc2 Nd7 24.f4 R5e6 25.e5 c6 26.f5 gxf5 27.Bxf5
cxd5 28.Bxe6 Rxe6 29.Rxf7 Kxf7 30.Qh7+ Ke8 31.Qxh5+ Ke7 32.Qg5+ Ke8
33.Qh5+ Ke7 34.Qh7+ 1/2-1/2
</pre>
=See also=
* [[Beowulf]]
* [[Chess Brain]]
* [[ChessBrainVB]]
* [[GridChess]]
=Publications=
<ref>[http://chessbrain.net/documentation.html ChessBrain Documentation]</ref>
* [[Carlos Justiniano]] ('''2003'''). ''ChessBrain: a Linux-Based Distributed Computing Experiment''. [https://en.wikipedia.org/wiki/Linux_Journal Linux Journal], September 2003, [http://chessbrain.net/docs/cblinuxjournal0903.pdf pdf]
* [[Carlos Justiniano]], [[Colin Frayn]] ('''2003'''). ''The ChessBrain Project: A Global Effort To Build The World's Largest Chess SuperComputer''. [[ICGA Journal#26_2|ICGA Journal, Vol. 26, No. 2]], [http://chessbrain.net/docs/thechessbrainproject.pdf pdf]
* [[Colin Frayn]], [[Carlos Justiniano]] ('''2004'''). ''The ChessBrain Project – Massively Distributed Inhomogeneous Speed-Critical Computation''. Proceedings IC-SEC, Singapore, 2004
* [[Kevin Lew]], [[Carlos Justiniano]], [[Colin Frayn]] ('''2005'''). ''Early experiences with clusters and compute farms in ChessBrain II''. BoF LinuxForum, [http://chessbrain.net/docs/ccfcb2.pdf pdf]
* [[Carlos Justiniano]] ('''2005'''). ''[http://chessbrain.net/LFBOF2005/tappingthematrix.html Tapping the Matrix: Harnessing distributed computing resources using Open Source tools]''. BoF LinuxForum
* [[Colin Frayn]], [[Carlos Justiniano]], [[Kevin Lew]] ('''2006'''). ''ChessBrain II – A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation''. [http://www.chessbrain.net/docs/chessbrainII.pdf pdf]
* [[Colin Frayn]], [[Carlos Justiniano]] ('''2007'''). ''The ChessBrain project''. in [http://www.springer.com/engineering/book/978-3-540-72704-0 Advanced Intelligent Paradigms in Computer Games]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/IRuxdsriHpE/dXzux4fNgDsJ Massive, planetary chess computer?] by [[Carlos Justiniano]], [[Computer Chess Forums|rgcc]], June 07, 2002
* [https://www.stmintz.com/ccc/index.php?id=279522 Chess-Brain Network] by Randy Adams, [[CCC]], January 26, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/od8sh6iy_xU/h3TewITgHh0J The Worlds Largest Chess Computer!] by [[Carlos Justiniano]], [[Computer Chess Forums|rgcc]], March 02, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/Y8JyXNBUO5c/0SC13qPrCtcJ IMPORTANT info for ChessBrain.net participants: team WINBOARD] by Ed Seid, [[Computer Chess Forums|rgcc]], March 31, 2003
* [https://www.stmintz.com/ccc/index.php?id=288743 chess brain] by [[Frank Phillips]], [[CCC]], October 03, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/jemmVlFzazM/fIaxeukUTBgJ Distributed Computing - BOINC and ChessBrain] by Ed Seid, [[Computer Chess Forums|rgcc]], December 21, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/lDxckrXYuNI/z4lGX79ErGcJ Event on January 30th: Chessbrain vs Peter Heine Nielsen] by Sascha Luehrs, [[Computer Chess Forums|rgcc]], January 25, 2004
* [https://groups.google.com/d/msg/rec.games.chess.computer/gjg4ns5gves/WO1G5_4bQ1cJ World Record Attempt TODAY] by Gregory Topov, [[Computer Chess Forums|rgcc]], January 30, 2004
=External Links=
==Chess Entity==
* [http://chessbrain.net/ ChessBrain]
* [http://frayn.net/blog/?p=662 Col’s Rational World » Blog Archive » ChessBrain] by [[Colin Frayn]]
* [http://www.rechenkraft.net/wiki/ChessBrain_(beendet) ChessBrain (beendet) – Rechenkraft] (German)
==Misc==
* [[:Category:Klaus Schulze|Klaus Schulze]] - [https://en.wikipedia.org/wiki/Timewind Timewind] (1975), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=qBn0Jnf7_3M|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[Category:Brain]]
[[Category:Klaus Schulze]]
[[FILE:Internet map 1024 - transparent, inverted.png|border|right|thumb|240px| Partial map of the Internet <ref>Partial map of the [https://en.wikipedia.org/wiki/Internet Internet] based on the January 15, 2005 data found on [http://www.opte.org/maps/ opte.org]. Each line is drawn between two nodes, representing two [https://en.wikipedia.org/wiki/IP_address IP addresses]. The length of the lines are indicative of the delay between those two nodes. This graph represents less than 30% of the [https://en.wikipedia.org/wiki/Classful_network Class C] networks reachable by the data collection program in early 2005. Lines are color-coded according to their corresponding [https://tools.ietf.org/html/rfc1918 RFC 1918], Original upload: December 1, 2006, [http://www.opte.org/ The Opte Project], [https://creativecommons.org/licenses/by/2.5/deed.en CC BY 2.5], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''ChessBrain''',<br/>
a chess playing entity inspired by the [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing] project [https://en.wikipedia.org/wiki/SETI@home SETI@home], consisting of a virtual chess supercomputer of over 2000 [https://en.wikipedia.org/wiki/Internet internet] connected machines running the [[Beowulf]] [[:Category:Open Source|open source chess engine]] <ref>[http://www.frayn.net/beowulf/ Beowulf Computer Chess Home Page]</ref>. The project was headed by [[Carlos Justiniano]], who wrote much of the networking infrastructure, and [[Colin Frayn]], who was responsible for the chess side of things <ref>[http://frayn.net/blog/?p=662 Col’s Rational World » Blog Archive » ChessBrain]</ref>, with many voluntary computer chess developers and even more aficionados contributing in improving and testing the program, or in providing processing resources. After the presentation of '''ChessBrain II''' in 2006 and first tests <ref>[http://chessbrain.net/ ChessBrain]</ref>, the ChessBrain project was abandoned.
=Description=
ChessBrain's <ref>Description based on: [[Colin Frayn]], [[Carlos Justiniano]], [[Kevin Lew]] ('''2006'''). ''ChessBrain II – A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation''. [http://www.chessbrain.net/docs/chessbrainII.pdf pdf]</ref> core [[Parallel Search|distributed search]] uses the [[APHID]] algorithm <ref>[[Mark Brockington]], [[Jonathan Schaeffer]] ('''1996'''). ''The APHID Parallel αβ Search Algorithm''. Technical Report 96-07, Department of Computing Science, [[University of Alberta]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.8215&rep=rep1&type=pdf pdf] from [https://en.wikipedia.org/wiki/CiteSeerX CiteSeerX]</ref> <ref>[[Mark Brockington]] ('''1998'''). ''Asynchronous Parallel Game-Tree Search''. Ph.D. Thesis, [[University of Alberta]], [http://www.collectionscanada.gc.ca/obj/s4/f2/dsk2/ftp02/NQ29023.pdf pdf]</ref>. It performs [[Iterative Deepening|iterative deepening]] firstly locally on the [https://en.wikipedia.org/wiki/Server_(computing) server] and after a certain fixed time, with new [[Leaf Node|leaf nodes]] being distributed as '''work units''' to [https://en.wikipedia.org/wiki/Peer-to-peer peer nodes] of a [https://en.wikipedia.org/wiki/Beowulf_cluster Beowulf cluster]. Work units encode [[Chess Position|position]] and [[Depth|search depth]] to be analyzed, distributed to the connected peer nodes on a request basis, also ranked by estimated complexity using extrapolation from their recorded complexity at previous, shallower depths, to implement [https://en.wikipedia.org/wiki/Load_balancing_(computing) load balancing] accordant to the peer nodes' performances. In case of a [[Fail-High|fail-high]] of its parent node, pending child peer nodes receive an abort signal to immediately return and retrieve a new work unit.
'''ChessBrain I''' used a [https://en.wikipedia.org/wiki/Supernode_(networking) supernode] to handle the remote coordination of hundreds of machines, using [https://en.wikipedia.org/wiki/XML XML] first via [https://en.wikipedia.org/wiki/XML-RPC XML-RPC], and later [https://en.wikipedia.org/wiki/SOAP SOAP], [https://en.wikipedia.org/wiki/Data_compression compressed] using [https://en.wikipedia.org/wiki/Zlib ZLib] and then encrypted using the [https://en.wikipedia.org/wiki/Advanced_Encryption_Standard AES Rijndael cipher] <ref>[[Mathematician#JDaemen|Joan Daemen]], [[Mathematician#VRijmen|Vincent Rijmen]] ('''1999'''). ''The Rijndael Block Cipher''. AES Proposal, [http://www.cryptosoft.de/docs/Rijndael.pdf pdf]</ref>.
With '''ChessBrain II''', jobs are distributed from a central server to remote [https://en.wikipedia.org/wiki/Computer_cluster cluster] nodes, which in turn manage local communities of peer nodes. Initially considering the [https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing Berkeley Open Infrastructure for Network Computing], which was designed with a [https://en.wikipedia.org/wiki/Client%E2%80%93server_model client–server model] in mind, the [https://en.wikipedia.org/wiki/Peer-to-peer peer-to-peer] requirements for ChessBrain II lead to the development of an own [https://en.wikipedia.org/wiki/Message message] [https://en.wikipedia.org/wiki/Courier courier] [https://en.wikipedia.org/wiki/Application_server application server], dubbed msgCourier, also published as [https://en.wikipedia.org/wiki/Source_code open source] <ref>[https://sourceforge.net/projects/msgcourier/ msgCourier download | SourceForge.net]</ref>.
=Guinness World Record=
<span id="game"></span>On January 30, 2004, ChessBrain played a game versus [https://en.wikipedia.org/wiki/Peter_Heine_Nielsen Peter Heine Nielsen] at [https://en.wikipedia.org/wiki/Symbion_Science_Park Symbion Science Park], [https://en.wikipedia.org/wiki/Copenhagen Copenhagen], [https://en.wikipedia.org/wiki/Denmark Denmak], which ended in draw. The game was an attempt of a [https://en.wikipedia.org/wiki/Guinness_World_Records Guinness World Record] for the largest number of computers used to play one single game of chess <ref>[http://www.guinnessworldrecords.com/world-records/largest-networked-chess-computer/ Largest networked chess computer | Guinness World Records]</ref>, on the ChessBrain site annotated by Nielsen and [[Eric Schiller]] <ref>[http://chessbrain.net/games.html ChessBrain - Game Commentary]</ref>.
<pre>
[Event "ChessBrain World Record Attempt"]
[Site "Copenhagen Denmark, Symbion Science Park"]
[Date "2004.1.30"]
[Round "1"]
[White "Peter Heine Nielsen"]
[Black "ChessBrain"]
[Result "1/2-1/2"]
1.d4 g6 2.c4 Bg7 3.e4 d6 4.Nc3 Nf6 5.Nf3 O-O 6.Be2 e5 7.O-O a5 8.Re1 exd4
9.Nxd4 Bd7 10.Bg5 Nc6 11.Nxc6 Bxc6 12.f3 Qd7 13.Qd2 Rfe8 14.Rac1 h5
15.Kh1 Nh7 16.Bh6 Bxh6 17.Qxh6 Re5 18.Nd5 Rae8 19.Qd2 b6 20.Bd3 Qd8
21.Rf1 Nf6 22.b3 Bb7 23.Qc2 Nd7 24.f4 R5e6 25.e5 c6 26.f5 gxf5 27.Bxf5
cxd5 28.Bxe6 Rxe6 29.Rxf7 Kxf7 30.Qh7+ Ke8 31.Qxh5+ Ke7 32.Qg5+ Ke8
33.Qh5+ Ke7 34.Qh7+ 1/2-1/2
</pre>
=See also=
* [[Beowulf]]
* [[Chess Brain]]
* [[ChessBrainVB]]
* [[GridChess]]
=Publications=
<ref>[http://chessbrain.net/documentation.html ChessBrain Documentation]</ref>
* [[Carlos Justiniano]] ('''2003'''). ''ChessBrain: a Linux-Based Distributed Computing Experiment''. [https://en.wikipedia.org/wiki/Linux_Journal Linux Journal], September 2003, [http://chessbrain.net/docs/cblinuxjournal0903.pdf pdf]
* [[Carlos Justiniano]], [[Colin Frayn]] ('''2003'''). ''The ChessBrain Project: A Global Effort To Build The World's Largest Chess SuperComputer''. [[ICGA Journal#26_2|ICGA Journal, Vol. 26, No. 2]], [http://chessbrain.net/docs/thechessbrainproject.pdf pdf]
* [[Colin Frayn]], [[Carlos Justiniano]] ('''2004'''). ''The ChessBrain Project – Massively Distributed Inhomogeneous Speed-Critical Computation''. Proceedings IC-SEC, Singapore, 2004
* [[Kevin Lew]], [[Carlos Justiniano]], [[Colin Frayn]] ('''2005'''). ''Early experiences with clusters and compute farms in ChessBrain II''. BoF LinuxForum, [http://chessbrain.net/docs/ccfcb2.pdf pdf]
* [[Carlos Justiniano]] ('''2005'''). ''[http://chessbrain.net/LFBOF2005/tappingthematrix.html Tapping the Matrix: Harnessing distributed computing resources using Open Source tools]''. BoF LinuxForum
* [[Colin Frayn]], [[Carlos Justiniano]], [[Kevin Lew]] ('''2006'''). ''ChessBrain II – A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation''. [http://www.chessbrain.net/docs/chessbrainII.pdf pdf]
* [[Colin Frayn]], [[Carlos Justiniano]] ('''2007'''). ''The ChessBrain project''. in [http://www.springer.com/engineering/book/978-3-540-72704-0 Advanced Intelligent Paradigms in Computer Games]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/IRuxdsriHpE/dXzux4fNgDsJ Massive, planetary chess computer?] by [[Carlos Justiniano]], [[Computer Chess Forums|rgcc]], June 07, 2002
* [https://www.stmintz.com/ccc/index.php?id=279522 Chess-Brain Network] by Randy Adams, [[CCC]], January 26, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/od8sh6iy_xU/h3TewITgHh0J The Worlds Largest Chess Computer!] by [[Carlos Justiniano]], [[Computer Chess Forums|rgcc]], March 02, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/Y8JyXNBUO5c/0SC13qPrCtcJ IMPORTANT info for ChessBrain.net participants: team WINBOARD] by Ed Seid, [[Computer Chess Forums|rgcc]], March 31, 2003
* [https://www.stmintz.com/ccc/index.php?id=288743 chess brain] by [[Frank Phillips]], [[CCC]], October 03, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/jemmVlFzazM/fIaxeukUTBgJ Distributed Computing - BOINC and ChessBrain] by Ed Seid, [[Computer Chess Forums|rgcc]], December 21, 2003
* [https://groups.google.com/d/msg/rec.games.chess.computer/lDxckrXYuNI/z4lGX79ErGcJ Event on January 30th: Chessbrain vs Peter Heine Nielsen] by Sascha Luehrs, [[Computer Chess Forums|rgcc]], January 25, 2004
* [https://groups.google.com/d/msg/rec.games.chess.computer/gjg4ns5gves/WO1G5_4bQ1cJ World Record Attempt TODAY] by Gregory Topov, [[Computer Chess Forums|rgcc]], January 30, 2004
=External Links=
==Chess Entity==
* [http://chessbrain.net/ ChessBrain]
* [http://frayn.net/blog/?p=662 Col’s Rational World » Blog Archive » ChessBrain] by [[Colin Frayn]]
* [http://www.rechenkraft.net/wiki/ChessBrain_(beendet) ChessBrain (beendet) – Rechenkraft] (German)
==Misc==
* [[:Category:Klaus Schulze|Klaus Schulze]] - [https://en.wikipedia.org/wiki/Timewind Timewind] (1975), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=qBn0Jnf7_3M|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[Category:Brain]]
[[Category:Klaus Schulze]]
