Skip to content
#

minimax-tree

Here are 14 public repositories matching this topic...

chess-minimax

Chess in Python and PyGame with a from scratch minimax AI: alpha-beta pruning, MVV-LVA move ordering, Zobrist transposition tables and piece-square evaluation. Full rules including castling, en passant and promotion, four difficulty levels, a move log, per player clocks and swappable sprite sets.

  • Updated Aug 15, 2026
  • Python

This project is an implementation of Suicide Chess, a variation of standard chess, using the Minimax algorithm enhanced with Alpha-Beta pruning. It simulates a two-player game where the objective is to lose all pieces, and evaluates multiple future moves to determine the most strategic sacrifices according to the rules of this variant.

  • Updated Jul 28, 2026
  • Python

Add this topic to your repo

To associate your repository with the minimax-tree topic, visit your repo's landing page and select "manage topics."

Learn more