Template:Chess programming series
|name = Chess programming series
|pretitle = This article is part of the series on
|title = Chess programming
| image = 150px
|headingstyle = background:#ccccff;
|contentclass = plainlist
|contentstyle = text-align:left
|liststyle = text-align:center
| list1name = Board representations
| list1title = Board representations
| list1 =
| list2name = Evaluation functions
| list2title = Evaluation functions
| list2 =
- Deep neural networks (Transformers)
- Attention
- Efficiently updatable neural networks
- Handcrafted evaluation functions
- Piece-square tables
- Reinforcement learning
- Stochastic gradient descent
- Supervised learning
- Texel tuning
- Unsupervised learning
| list3name = Graph and tree search algorithms
| list3title = Graph and tree search algorithms
| list3 =
| list4name = Chess computers
| list4title = Chess computers
| list4 =
| list5name = Chess engines
| list5title = Chess engines
| list5 =
- AlphaZero
- Chess Tiger
- Crafty
- CuckooChess
- Deep Fritz
- Dragon by Komodo Chess
- Fairy-Max
- Fritz
- Fruit
- GNU Chess
- HIARCS
- Houdini
- Ikarus
- Junior
- KnightCap
- Komodo
- Leela Chess Zero
- MChess Pro
- Mittens
- MuZero
- Naum
- REBEL
- Rybka
- Shredder
- Sjeng
- SmarThink
- Stockfish
- Torch
- Turochamp
- Zappa
}}