Template:Chess programming series - Wikipedia

Chess programming
This article is part of the series on

Board representations 0x88 Bitboards
Evaluation functions Artificial neural networks Efficiently updatable neural networks Piece-square tables Handcrafted evaluation functions Deep neural networks Transformers Convolutional neural networks Residual neural networks Attention
Tuning and training algorithms Reinforcement learning Supervised learning Unsupervised learning Gradient descent Stochastic gradient descent Local search (Texel tuning)
Graph and tree search algorithms Minimax Alpha-beta pruning Principal variation search Quiescence search Monte Carlo tree search
Chess computers Belle ChessMachine ChipTest Deep Blue Deep Thought HiTech Hydra Mephisto Saitek
Chess engines AlphaZero Chess Tiger Crafty Cray Blitz 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
v t e

This page was redesigned at the edge.