From Chessprogramming wiki
Jump to: navigation, search

Home * Engines * Moby

a multiprocessor chess program participating at the WCCC 1989, running on a large Meiko Computing Surface, based on Inmos T800 Transputer chips [2], installed at University of Edinburgh as part of the Edinburgh Concurrent Supercomputer Project. Moby was a descendant of Cyrus 68K, whose development begun by Mark Taylor and David Levy in 1985, the parallel implementation was done by Greg Wilson.



based on WCCC 1989 booklet [3]

Moby was a conventional searcher, but distributed the search across the available processors in a homogeneous fashion, that is all processors are carrying out the same type of operations, rather than some processors doing deep scout searches while others do more complete searches guided by the information returned by the scouts. Load balancing is archived by processor overloading - each processor supports a hash table manager responsible for part of the global transposition table. One distinguished processor acts as system master, interacting with the user and handling file i/o when the opening books are consulted. 

Selected Games

WCCC 1989, round 1, Moby - Deep Thought [4]

[Event "WCCC 1989"]
[Site "Edmonton, Canada"]
[Date "1989.05.28"]
[Round "1"]
[White "Moby"]
[Black "Deep Thought"]
[Result "0-1"]

1.d4 d5 2.Nc3 Nf6 3.Bg5 Nbd7 4.Qd3 h6 5.Bh4 c6 6.Nf3 g6 7.h3 Bg7 8.g4 Qa5 9.a3 Nf8 
10.Qe3 h5 11.gxh5 Rxh5 12.O-O-O Bf5 13.Bg5 Ne4 14.Bf4 Ne6 15.Nxe4 Bxe4 16.Qb3 Nxf4 
17.Qxb7 Qd8 18.Qxc6+ Kf8 19.Qa6 Qc7 20.Rd2 Bh6 21.Kd1 Rb8 22.c3 Qxc3 23.Rg1 Nxh3 
24.Qxa7 Rxb2 25.Qa5 Rb1# 0-1

External Links

Chess Program



Up one Level