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''. [http://dblp.uni-trier.de/db/conf/ijcai/ijcai73.html [Conferences#IJCAI1973|3. IJCAI 1973]], [http://www.ijcai.org/Past%20Proceedings/IJCAI-73/PDF/004.pdf pdf]</ref>.

Dartmouth's most "informed" table was the one on pawn formations, called "PFORM". Among its standard detectors were [[Isolated Pawn|Isolated Pawns]], [[Backward Pawn|Backward Pawns]], [[Doubled Pawn|Doubled Pawns]], [[Passed Pawn|Passed Pawns]], and [[Duo Trio Quart (Bitboards)|Duos]]. Detectors such as [[Pawn chainChain|Chains]], [[Defended Pawns (Bitboards)|Mini-chains]], [[Backward Pawns (Bitboards)|Shielded Backward Pawns]], [[Candidate Passed Pawn|Potential Passed Pawns]], and the table, "Levers", were among the more esoteric concepts which were added later. Many of these definitions were taken directly from [[Hans Kmoch|Hans Kmoch's]] classic work ''Pawn Power'' <ref>[[Hans Kmoch]] ('''1959, 1990'''). ''Pawn Power in Chess''. New York: Dover, 1990. Previous ed.: New York: McKay, 1959. ISBN 0-486-26486-6, [http://books.google.com/books?id=FT7hpAiec3EC&dq=Pawn+Power+in+Chess&pg=PP1&ots=q_yCx72Ms_&sig=sKrQzXouaweUYbwCjfTcaplUF4U&hl=de&sa=X&oi=book_result&resnum=1&ct=result#PPA1,M1 Google Books], [http://www.amazon.com/Pawn-Power-Chess-Hans-Kmoch/dp/0486264866 amazon]</ref>. The concept, Levers, using a modified definition of my own "pawn mover wich improve our formation and hurt our opponent's" - proved useful in the recognition of critical pawn moves. In addition, the levers concept helps to guide the placement of pieces especially in the opening and middle game. It could also help toward plan formation. Some further pawn formational concepts from ''Pawn Power'' which were never programmed were [[Outposts|Outpost]] and [[Holes|Weak Square]] Complexes. The Dartmouth program is probably, in theory, capable of more sophisticated pawn formational evaluations than any other program; however the implementation is rudimentary. The program had at one time approximately 50 detectors in various tables and many others were planned.

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