oriyanh / Bridge-AI
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…
☆17Updated 4 years ago
Alternatives and similar repositories for Bridge-AI:
Users that are interested in Bridge-AI are comparing it to the libraries listed below
- A reimplementation of Thomas Andrews' Deal in Python.☆64Updated last month
- Python 3 ctypes port of dds, the bridge double dummy solver☆16Updated 6 years ago
- Double Dummy Solver written in C++ for the Bridge Card Game☆136Updated 10 months ago
- A simple implementation of MuZero algorithm for connect4 game☆97Updated 4 years ago
- a game engine for bridge☆50Updated this week
- AlphaZero-like AI solution for playing Ultimate Tic-Tac-Toe in the browser☆67Updated 3 years ago
- The released model of the paper 'Automatic Bridge Bidding by Deep Reinforcement Learning' in ECAI 2016☆19Updated 8 years ago
- A reimplementation of the Google AlphaZero algorithm.☆18Updated 4 years ago
- ☆30Updated 6 years ago
- A collection of Gymnasium compatible games for reinforcement learning.☆78Updated last year
- Single player Alpha Zero implementation☆42Updated 3 years ago
- Parser for contract bridge "lin" notation☆11Updated 11 years ago
- MiniZero: An AlphaZero and MuZero Training Framework☆88Updated last month
- Open AI gym environment for the game 2048☆73Updated 3 years ago
- Counterfactual regret minimization algorithm for Kuhn poker☆171Updated 6 years ago
- Monte Carlo Conterfactual Regret Minimization for imperfect information games☆13Updated 6 years ago
- AlphaZero in JAX☆77Updated last year
- An experimental setup for running quality diversity algorithms on GAN latent spaces.☆21Updated 4 years ago
- SpielViz is an interactive viewer for OpenSpiel games.☆30Updated 11 months ago
- Pytorch Implementation of MuZero☆351Updated last year
- Counterfactual Regret Minimization for poker games☆21Updated 5 years ago
- PyTorch implementation of AlphaZero Connect from scratch (with results)☆81Updated 5 years ago
- ☆299Updated 4 months ago
- Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space…☆68Updated last year
- ☆24Updated 6 years ago
- Simplified Action Decoder for Deep Multi-Agent Reinforcement Learning☆100Updated 2 years ago
- ☆11Updated last year
- A neural net chess engine in 95 lines of python☆74Updated 4 years ago
- ☆18Updated last year
- ☆17Updated 5 years ago