Much

[[toc]]
**[[Home]] * [[Engines]] * Much**

**Much**, the [[Maastricht University]] Chess Program by primary authors [[Roger Hünen]], [[Harry Nefkens]], [[Tom Pronk]] and [[Jaap van den Herik]] <ref>[[http://www.game-ai-forum.org/icga-tournaments/program.php?id=355|Much's ICGA Tournaments]]</ref>, represented and operated at the [[WCCC 1989]] by [[Jos Uiterwijk]] and [[Harm Bakker]]. Much was written in [[C]], and run on a [[Sun#4|Sun-4]] [[https://en.wikipedia.org/wiki/Workstation|workstation]].

=Authors=
* [[Roger Hünen]]
* [[Harry Nefkens]]
* [[Tom Pronk]]
* [[Jaap van den Herik]]

=Description=
based on [[WCCC 1989]] booklet <ref>[[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3|Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.]] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]], [[http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf|pdf]]</ref>:

Much consists of several programs. The user-interface program accepts a move from the operator and subsequently generates evaluation tables for the 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 program receives the [[Chess Position|board position]] and [[Piece-Square tables|evaluation tables]] from the user-interface program. The evaluation tables are tuned 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 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, KBPK and KNPK endgames. These programs use a goal-directed search.

=See also=
* [[Various Classifications#Acronym|Acronym]]

=External Links=
* [[http://www.game-ai-forum.org/icga-tournaments/program.php?id=355|Much's ICGA Tournaments]]

=References= 
<references />
=What links here?= 
[[include page="Much" component="backlinks" limit="40" ]]
**[[Engines|Up one level]]**