Skip to content

Latest commit

 

History

History
40 lines (35 loc) · 1.84 KB

README.md

File metadata and controls

40 lines (35 loc) · 1.84 KB

build-passing test-passing made-with-python made-with-pygame

Tic Tac Toe

Harvard CS50's Introduction to Artificial Intelligence with Python (Project 0)

This game is never going to let you win!

Description

In this project, an Artificial Intelligence bot has been implemented that never lets you win. This is an implementation of minimax - an adversial search algorithm - to find out the best next move which will lead to human player either loosing or drawing the match.
Alpha-beta pruning is also implemented to optimize the algorithm: minValue() and maxValue() return the action as soon as they find a solution with utility of -1 and 1 respectively.

Screenshots

Gameplay (GIF - 42 seconds)

Gameplay


Main Menu

Main Menu


Gameplay - 1

gameplay one


Gameplay - 2

gameplay two


Game End

end game