Minimax Chess

Play a friend, or an AI that searches up to four moves ahead.

Source on GitHub

The computer uses minimax search with alpha-beta pruning, capture-first move ordering and a quiescence search, scoring positions by material and piece-square tables. It runs in a background worker so the board stays responsive. This is the browser version of a Java Swing chess game.