The main hash table is only used during the full-width portion of the search and does not record the best move from previous iterations. The search techniques include check extensions and capture extensions, but no singular extensions. Positional evaluation can exceed the value of a pawn. A small hash table is used for pawn-structure evaluation. Development is stressed in the opening, king safety and mobility in the middle game, and passed pawns and an active king in the endgame. ![]() By means of logical switches in the evaluator, the program dynamically selects a set of heuristics depending on the type of position (early opening, late opening, early middle game, late middle game, endgame, several specific endgames). ![]() 2 Written by Marty Hirsch, an expert IBM-PC programmer previously known for a program called AI-Chess, M-Chess is a new program that has taken 3 man-years to develop. M-Chess Pro 3.5 (1993) Descriptions 1991įrom ICCA Journal, Vol.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |