Changes

Jump to: navigation, search

Much

38 bytes added, 17:58, 26 December 2019
no edit summary
=Description=
based on [[WCCC 1989]] booklet <ref>[https://www.computerhistory.org/chess/doc-434fea055cbb3/ Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], hosted by[[The Computer History Museum]]</ref>:
Much consists of several programs. The [[User Interface|user-interface]] program accepts a move from the operator and subsequently generates [[Piece-Square tablesTables|evaluation tables]] for the [[Search|search program]]. The user-interface program also handles [[Time Management|time control]], the [[Opening Book|opening library]], and the [[Endgame Tablebases|endgame library]]. The [[Search|search program]] receives the [[Chess Position|board position]] and [[Piece-Square tablesTables|evaluation tables]] from the user-interface program. The evaluation tables are tuned with the opening played. Before each move they are [[Incremental Updates|incrementally updated]] according to the board position (strategical evaluation of squares), but also bonus points are provided to undeveloped pieces, the [[Bishop Pair|pair of Bishops]] in open positions ([[Middlegame|middlegame]]/[[Endgame|endgame]]), the Color of the Pawns and Bishop on the board (endgame). Moreover, several [[Planning|plans]] are encouraged. The configuration belonging to the execution of a plan is supplied with bonus points such that every piece and pawn involved tries to reach the plan-ideal square. The plan as a whole, once started to be carried out, increases the bonus points for every piece/pawn to be played at each move. Much then searches until it is interrupted by the user-interface program. The search program, based on the [[Alpha-Beta|alpha-beta]] algorithm and its refinements, uses [[Principal Variation Search|PVS-search]], [[Killer Heuristic|killer]] and [[Transposition Table|transposition tables]]. [[Move Generation|Move generation]] is done incrementally. Much uses specialized sub-programs to handle the KBBK, [[KBNK Endgame|KBNK]], KBPK and KNPK endgames. These programs use a goal-directed search.
=See also=
'''[[Engines|Up one level]]'''
[[Category:Acronym]]
[[Category:SPARC]]
[[Category:Sun-4]]

Navigation menu