chess:programming:introduction
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| chess:programming:introduction [2021/10/11 19:06] – peter | chess:programming:introduction [2021/10/11 19:11] (current) – peter | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Chess - Programming - Introduction ====== | ====== Chess - Programming - Introduction ====== | ||
| + | |||
| + | To create a strong chess program: | ||
| + | |||
| + | * Have fast move generators. | ||
| + | * Use data structures that allow fast makemove and unmakemove algorithms. | ||
| + | * Search a relatively small number of moves only (using aggressive forward pruning rules, allowing them to search deeper). | ||
| + | * Have extensive evaluation functions that capture a significant amount of chess knowledge. | ||
| + | |||
| + | ---- | ||
| Goals: | Goals: | ||
| Line 5: | Line 14: | ||
| * The **Evaluation** and **Search** functions are the heart & soul of a chess engine. | * The **Evaluation** and **Search** functions are the heart & soul of a chess engine. | ||
| * Improve Evaluation, Search and Move sorting in particular. | * Improve Evaluation, Search and Move sorting in particular. | ||
| - | * Consider **BitBoards**. | + | * Consider |
| Line 20: | Line 29: | ||
| * The score is usually expressed in centipawns (a pawn equals 100). | * The score is usually expressed in centipawns (a pawn equals 100). | ||
| - | Speed is important, and there are many techniques to improve the search speed of a chess program (including using bitboards and hash tables). | + | Speed is important, and there are many techniques to improve the search speed of a chess program (including using bitboards and hash tables). |
| + | |||
| + | * Some chess engines will display their search speed in knods/s (1000 nodes per second). | ||
chess/programming/introduction.1633979202.txt.gz · Last modified: 2021/10/11 19:06 by peter