From Chessprogramming wiki
Jump to: navigation, search

Home * Engines * Nuchess

the Northwestern University chess program by David Slate, one of the original authors of Chess x.x, and William Blanchard of Vogelback computing center at Northwestern University. Nuchess played the WCCC 1980 in Linz on a CDC Cyber 176 and the WCCC 1983 in New York on a Cray-1 4Mb, becoming sixth and fourth respectively. Nuchess further participiated at the ACM 1981 (runner up), the ACM 1982, where Belle won on tie-break points before Cray Blitz, Nuchess and CHAOS, all 3/4, and the ACM 1984. Nuchess was a 64 bit program, written in Fortran, program size in 1983 was about 250K and it searched about 2.8K Nodes per second [1] . Nuchess, apparently the successor of Chess 4.9, was mentioned as Chess 5.0 at the Ars Electronica site of the WCCC 1980 [2] , where Chess 4.9 did also compete with Larry Atkin and David Cahlander as authors.

Photos & Games

3-1 and 3-2.Thompson Friedel Condon Slate Blanchard.WCCC-New York.1983.102645364.THOMPSON.lg.jpg

Ken Thompson, Frederic Friedel, Joe Condon, David Slate, and William Blanchard

WCCC 1983, Nuchess - Belle [3]

[Event "WCCC 1983"]
[Site "New York, USA"]
[Date "1983.10.23"]
[Round "3"]
[White "Nuchess"]
[Black "Belle"]
[Result "1-0"]

1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.d4 exd4 6.O-O Be7 7.e5 Ne4 8.Nxd4 O-O
9.Nf5 d5 10.exd6 Bxf5 11.dxe7 Nxe7 12.Be3 Nd5 13.Qf3 Nxe3 14.fxe3 Bg6 15.Qf4 b5
16.Bb3 c5 17.c4 Qf6 18.Qxf6 Nxf6 19.Rc1 b4 20.Nd2 Rfe8 21.Re1 Rad8 22.Nf1 Bd3
23.Rad1 Ng4 24.Ba4 Rf8 25.Nd2 Ne5 26.Bb3 Rd6 27.Nf3 Nxf3+ 28.gxf3 f5 29.Rd2 Re8
30.Kf2 f4 31.exf4 Rxe1 32.Kxe1 Rd4 33.Kf2 Kf7 34.Ke3 Bxc4 35.Rxd4 cxd4+ 36.Kxd4
Bxb3 37.axb3 Kf6 38.Ke4 g6 39.h4 Ke6 40.f5+ gxf5+ 41.Kd4 Kd6 42.f4 Ke6 43.Kc5 a5
44.h5 Kf7 45.Kd5 Kf6 46.Kd6 Kf7 47.Ke5 Ke8 48.Kxf5 1-0
3-1 and 3-2.Thompson Botvinnik.WCCC 4.New York.1983.102645366.NEWBORN.lg.jpg

Ken Thompson now with Mikhail Botvinnik kibitzing - just before 19... b4

Game and short analyze on : [1]

Interior Node Recognizer

Like Chess 4.x, Nuchess was a brute-force chess program. It did not only evaluate leaf nodes but also the interior of the tree, to narrow bounds and to concern with determinations of or guesses of game-theoretic win/draw/loss values [4] .

See also


External Links


Up one level