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:08] – 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: | ||
chess/programming/introduction.1633979291.txt.gz · Last modified: 2021/10/11 19:08 by peter