Changes

a chess program developed in the early 70s at [[Dartmouth College]] by a team lead by professor [[Larry Harris]]. Primary author was [[Warren Montgomery]] <ref>[httphttps://www.dartmouth.edu/comp/aboutits-tools/archive/history/timeline/1970s.html#1973 The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament]</ref>, supported by co-authors [[Danny Kopec]], [[Hal Terrie]], [[David Levner]] and others <ref>[[Danny Kopec]] ('''1977'''). ''Recent developments in computer chess''. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, [[University of Edinburgh]] (ed. [[Donald Michie]]), [http://www.sci.brooklyn.cuny.edu/~kopec/Publications/Publications/O_45_C.pdf pdf] - Work at Dartmouth College</ref>. Dartmouth CP was written in [https://en.wikipedia.org/wiki/General_Comprehensive_Operating_System GCOS] [[Assembly|assembly]], the language for the [[Honeywell 6000|GE-635]], to run under the [https://en.wikipedia.org/wiki/Dartmouth_Time_Sharing_System Dartmouth Time Sharing System]. In his 1973 paper on [[Bandwidth Search]] <ref>[http://theory.stanford.edu/~amitp/GameProgramming/Variations.html#bandwidth-search Bandwidth search | Variants of A*] from [http://theory.stanford.edu/~amitp/GameProgramming/ Amit’s A* Page]</ref>, 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 <ref>[[Larry Harris]] ('''1973'''). ''The bandwidth heuristic search''. [[Conferences#IJCAI1973|3. IJCAI 1973]], [http://www.ijcai.org/Past%20Proceedings/IJCAI-73/PDF/004.pdf pdf]</ref>.

* [httphttps://www.dartmouth.edu/comp/aboutits-tools/archive/history/timeline/1970s.html#1973 The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament]