GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Chess Programming Wiki
  • All pages
  • Other namespaces
  • Categories
  • Credits

This view

  • Original page
  • New address

GeezerVison is showing chessprogramming.org — Much - Chess Programming Wiki

Much

Home * Engines * Much

Much, (MUCH)
the Maastricht University Chess Program by primary authors Roger Hünen, Harry Nefkens, Tom Pronk and Jaap van den Herik 1, represented and operated at the WCCC 1989 by Jos Uiterwijk and Harm Bakker. Much was written in C, and run on a Sun-4 workstation.

Contents
  1. Authors
  2. Description
  3. See also
  4. External Links
  5. References

Authors

  • Roger Hünen
  • Harry Nefkens
  • Tom Pronk
  • Jaap van den Herik

Description

based on WCCC 1989 booklet 2:

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 control, the opening library, and the endgame library. The search program receives the board position and evaluation tables from the user-interface program. The evaluation tables are tuned with the opening played. Before each move they are incrementally updated according to the board position (strategical evaluation of squares), but also bonus points are provided to undeveloped pieces, the pair of Bishops in open positions (middlegame/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 algorithm and its refinements, uses PVS-search, killer and transposition tables. 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

  • Dutch

External Links

  • Much's ICGA Tournaments

References

Up one level


  1. Much's ICGA Tournaments↩︎

  2. Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings, hosted byThe Computer History Museum↩︎

Categories: Acronym · SPARC · Sun-4

What links here

Contributors: GerdIsenberg.

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.