Skip to content

A PyGame chess board and game implementing the MinMax algorithm.

Notifications You must be signed in to change notification settings

Christakou/Shallow-Blue

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Shallow Blue

A fully working chess-game made in Python (PyGame) using the MinMax algorithm and Alpha-Beta prunning to reduce the search space of possible moves.

Introduction

This project aims at creating a playable chess game, by both fully implementing the board environment in PyGame, but also the AI agent to play against.

The value function implemented currently is very simplistic and only looks at how many pieces are of each colour and sums their respective value.

We represent the board states as python objects and use the MinMax algorithm to find the best move by looking at the future possible boards that arise from each move.

Installation

Clone the repo into a new environment and install PyGame.

pip install pygame

Future Plans

  • Implement a more memory efficient board representation using Numpy arrays
  • Implement a more sophisticated evaluation function that is capable of deriving value from positional attributes (bishop pairs, rooks on open files, knights protecting each other etc...)

About

A PyGame chess board and game implementing the MinMax algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages