Dartmouth+CP

a chess program developed in the early 70s at Dartmouth College by a team lead by professor Larry Harris. Primary author was Warren Montgomery, supported by co-authors Danny Kopec, Hal Terrie, David Levner and others. Dartmouth CP was written in [|GCOS] assembly, the language for the GE-635, to run under the [|Dartmouth Time Sharing System].
 * Home * Engines * Dartmouth CP**
 * [[image:Keggy_the_Keg.jpg link="https://en.wikipedia.org/wiki/Keggy_the_Keg"]] ||~ || **Dartmouth CP**,

In his 1973 paper on Bandwidth Search, which was applied successfully to chess and therefor likely to Dartmouth CP, Larry Harris acknowledged professor Steve Garland and the undergraduates Warren Montgomery, Dave Chenerow, Dexter Kozen, and Steve Poulsen for their work on that topic. || toc =Challenging Chess= Excerpt from Danny Kopec's //Recent developments in computer chess// : code [Event "ACM 1973"] [Site "Atlanta USA"] [Date "1973.08.26"] [Round "2"] [White "Dartmouth CP"] [Black "Chess 4.0"] [Result "1/2-1/2"]
 * [|Keggy the Keg] ||~ ||^ ||

1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 d6 6.Be3 Nxd4 7.Bxd4 e5 8.Be3 Be7 9.Bb5+ Bd7 10.Qd3 O-O 11.O-O-O Ng4 12.Bxd7 Qxd7 13.Nd5 Bh4 14.f3 Nf2 15.Bxf2 Bxf2 16.Rd2 Bc5 17.b4 Bd4 18.c3 Bb6 19.Nxb6 axb6 20.b5 Kh8 21.Qd5 Rfc8 22.Kb2 Rc5 23.Qxd6 Rxb5+ 24.Ka1 Qc8 25.Qd3 Rba5 26.Rb1 Qc7 27.Rb4 Ra3 28.Rc4 Qe7 29.Rb4 Qf6 30.Rb5 R3a4 31.Qd5 Qh4 32.Rxb6 R4a5 33.Qd6 Qe1+ 34.Rb1 Qh4 35.Qd7 b5 36.Qxf7 Qxh2 37.Qd7 Qf4 38.Qd8+ Qf8 39.Qxf8+ Rxf8 40.Kb2 Rfa8 41.Ra1 R5a6 42.Rd5 Rg6 43.g4 Rf6 44.Rxb5 Rxf3 45.Rxe5 Rb8+ 46.Kc2 Rc8 47.Kb3 Rfxc3+ 48.Kb4 Rc2 49.Re7 Rb2+ 50.Ka3 Rg2 51.e5 Rxg4 52.e6 Rg2 53.Ka4 Rb2 54.Ra7 h5 55.a3 Rc4+ 56.Ka5 Rc5+ 57.Ka4 g5 58.e7 Rc4+ 59.Ka5 Rb8 60.Re1 Rc5+ 61.Ka4 Rcc8 62.Re5 Ra8 63.Rxa8 Rxa8+ 64.Kb5 Re8 65.Rxg5 Rxe7 66.Rxh5+ Kg7 67.Kb6 Re6+ 68.Kb5 Re7 69.Kb6 Re6+ 70.Kb5 Re7 71.Kb6 1/2-1/2 code

=Evaluation= Danny Kopec in //Recent developments in computer chess// on the Evaluation of Dartmouth CP :

||

=Publications=
 * Larry Harris (**1973**). //The bandwidth heuristic search//. [|3. IJCAI 1973], [|pdf]
 * Larry Harris (**1974**). //Heuristic Search under Conditions of Error//. Artificial Intelligence, Vol. 5, No. 3, pp. 217-234. ISSN 0004-3702. Also published (**1977**) under the title: //The heuristic search: An alternative to the alpha-beta minimax procedure.// Chess Skill in Man and Machine (ed. Peter W. Frey), pp. 157-166
 * Larry Harris (**1975**) //The Heuristic Search And The Game Of Chess - A Study Of Quiescence, Sacrifices, And Plan Oriented Play//. [|4. IJCAI 1975], 334-339. reprinted in Computer Chess Compendium by David Levy (Editor), pp. 136 - 142
 * Danny Kopec (**1977**). //Recent developments in computer chess//. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), [|pdf]

=External Links=
 * [|The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament]

=References= =What links here?= include page="Dartmouth CP" component="backlinks" limit="40"
 * Up one Level**