Changes

The most sensitive and important part of Brutus [[Search|search]] algorithm is [[Parallel Search|distributed]] among several standard PCs, connected via a high-speed [https://en.wikipedia.org/wiki/Myrinet Myrienet]. One of the processors Based on [https://en.wikipedia.org/wiki/Work_stealing work stealing], one processor receives the current chess position and basically begins a sequential [[Alpha-Beta|alpha beta search]]. Idle , while idle processors send work requests randomly around the net - when . When a working processor captures such a request, it distributes part of his own (sub-) problem. Using a tricky [https://en.wikipedia.org/wiki/Message_passing messaging system] between the processors, the work is dynamically balanced with little search overhead. After a while, all processors have something useful to do. A processor generates approximately 100,000 searches on a FPGA board per second <ref>[http://www.chessbase.de/nachrichten.asp?newsid=2435 Parallele Schachprogrammierung], [[ChessBase|ChessBase News]], September, 16, 2003 (German)</ref>.