585
edits
Changes
no edit summary
=Purposes=
* Save time: Chess programs could use [[Search|search]] from the beginning and look through all possible continuations in detail to find the best next move, but as this is quite time-consuming and there already exists a lot of [https://en.wikipedia.org/wiki/Chess_opening_book_%28literature%29 literature] about different opening lines, opening books save time.
* Provide a higher quality of play. : Searching only can't deep tactics and strategy.* Provide variety, : as book moves are usually chosen [[Pseudorandom Number Generator|randomly]], whereas searches are more or less deterministic.
* [[EPD]]: They are the last positions of opening lines
* [[PGN]]: Opening lines are stored as individual games
<span id="BookBuilder"></span>* Special formats such as : In 1999, [[Marc-Philippe Huget]] published a '''Book Builder''' <ref>[https://www.stmintz.com/ccc/index.php?id=44407 Web site updated and new program Book Builder] by [[Marc-Philippe Huget]], [[CCC]], February 24, 1999</ref> in conjunction with his engine [[La Dame Blanche]], a standalone open source program <ref>[http://www.quarkchess.de/ladameblanche/ Book Bilder of La Dame Blanche] by [[Marc-Philippe Huget]], hosted by [[Thomas Mayer]]</ref> to convert a [[Portable Game Notation|PGN file]] into an opening book of the format proposed by [[Kathe Spracklen]] <ref>[[Kathe Spracklen]] ('''1983'''). ''Tutorial: Representation of an Opening Tree''. [[ICGA Journal#6_1|ICCA Newsletter, Vol. 6, No. 1]]</ref>:<pre>(e4(e5)(c5))(d4d5))etc.</pre>
==Binary==
* [[BanksiaGUI]]
=Quotes=
To solve the opening problems of his chess machine, [[Belle]], [[Ken Thompson]] typed in opening lines from the ''[https://en.wikipedia.org/wiki/Encyclopaedia_of_Chess_Openings Encyclopedia of Chess Openings]'' (in five thick volumes). Religiously, he dedicated one hour a day for almost three years (!) to the tedious pursuit of entering lines of play from the books and having his Belle computer verify them. The result was an opening library of roughly three-hundred thousand moves. The results were immediate and obvious: Belle became a much stronger chess program, and Ken probably aged prematurely. Later Ken developed a program to automatically read the ''Encyclopedia'', allowing him to do in a few days what had taken him three years to do manually. <ref>[[Mathematician#HSBaird|Henry S. Baird]], [[Ken Thompson]] ('''1990'''). ''[http://doc.cat-v.org/bell_labs/reading_chess/ Reading Chess]''. [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 12, No. 6, [http://doc.cat-v.org/bell_labs/reading_chess/reading_chess.pdf pdf]</ref>
<span id="Formats"></span>
=Formats=
* [[ABK]] - [[Arena|Arena's]] book format
