Skip to content
#

minmax-algorithm

Here are 352 public repositories matching this topic...

alpha-beta-pruning-minmax-checkers

Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.

  • Updated Dec 19, 2020
  • Python

In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…

  • Updated Aug 22, 2020
  • Python

Improve this page

Add a description, image, and links to the minmax-algorithm 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 minmax-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more