chess:programming:checklist
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| chess:programming:checklist [2021/12/16 16:57] – peter | chess:programming:checklist [2022/01/08 12:54] (current) – [Evaluations] peter | ||
|---|---|---|---|
| Line 22: | Line 22: | ||
| * Polygot. [done] | * Polygot. [done] | ||
| * Random Move Generation. [done] | * Random Move Generation. [done] | ||
| - | * Staged Move Generation. | + | * Staged Move Generation. |
| * Some programs do not generate all moves at once, but do it in several stages (i.e. hash move first, then captures, then killer moves, then all the rest in a chunk) on the premise that if one of the early moves causes a cutoff, then we may save on the effort of generating the rest of the moves. | * Some programs do not generate all moves at once, but do it in several stages (i.e. hash move first, then captures, then killer moves, then all the rest in a chunk) on the premise that if one of the early moves causes a cutoff, then we may save on the effort of generating the rest of the moves. | ||
| + | * Check extensions. When the own king is in check only generate moves that can be made to avoid the check. [done] | ||
| ===== Move Prioritization ===== | ===== Move Prioritization ===== | ||
| + | * Move Ordering. | ||
| * Best Move (from hash table). | * Best Move (from hash table). | ||
| * Captures: | * Captures: | ||
| Line 47: | Line 49: | ||
| * Alpha / Beta search. [done] | * Alpha / Beta search. [done] | ||
| - | * Negamax search. | + | * Negamax search. |
| * Aspiration Windows. | * Aspiration Windows. | ||
| - | * MinMax search. | + | * MinMax search. |
| * MultiPV (Single, non-PVS search). | * MultiPV (Single, non-PVS search). | ||
| * Multi Threading. | * Multi Threading. | ||
| Line 70: | Line 72: | ||
| * Standard Evaluations: | * Standard Evaluations: | ||
| - | * Mate. | + | * Mate. [done] |
| - | * Stalemate. | + | * Stalemate. |
| * Draw by 3-fold repetition. | * Draw by 3-fold repetition. | ||
| - | * Draw by insufficient material. | + | * Draw by insufficient material. |
| - | * 50 moves without a capture | + | * 50 moves without a pawn move. [done] |
| - | * Material Values. | + | * 75 moves without a capture |
| + | * Material Values. | ||
| * Tapered Evaluation - Different values at different stages of the game (beginning, middle-game, | * Tapered Evaluation - Different values at different stages of the game (beginning, middle-game, | ||
| * Positional Knowledge. | * Positional Knowledge. | ||
| * Piece Locations: | * Piece Locations: | ||
| - | * Good and Bad squares. | + | * Good and Bad squares. |
| * Relative to own pieces. | * Relative to own pieces. | ||
| * Relative to opponent pieces. | * Relative to opponent pieces. | ||
| * Threatened pieces. | * Threatened pieces. | ||
| - | * Piece Mobility. | + | * Piece Mobility. |
| - | * Piece Occupancy. | + | * Piece Occupancy. |
| - | * Control of Center. | + | * Control of Center. |
| * End-Games. | * End-Games. | ||
| * Drawing end-games. | * Drawing end-games. | ||
chess/programming/checklist.1639673821.txt.gz · Last modified: 2021/12/16 16:57 by peter