Skip to content
#

minimax-chess

Here are 8 public repositories matching this topic...

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

A full-featured Python Chess game with GUI built using Tkinter, featuring a Minimax AI opponent with alpha-beta pruning, threaded AI computation, move validation, check/checkmate detection, and player timers.

  • Updated Feb 2, 2026
  • Python

Improve this page

Add a description, image, and links to the minimax-chess topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

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

Learn more