Skip to content

Playing TicTacToe with AI's Adversarial Search Algorithm - Minimax

Notifications You must be signed in to change notification settings

charleyoshi/tictactoe-minimax

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Minimax - TicTacToe with AI's Adversarial Search Algorithm

TicTacToe Game with AI's Adversarial Search Algorithm - Minimax

Description

Playing against the computer, the user can choose 3 levels of difficulties.

Level 1 is Easy. The computer randomly makes a move.
Level 2 is Medium. The program is hard-coded to always fill the 4 corners first.
Level 3 is Boss. You can never beat the computer, which finds moves by an Adversarial Search Algorithm, Minimax.

Getting Started

Executing program

  • The program is not visually fancy, so you can just run it in your terminal
python3 runner.py

Authors

ex. Charley Yoshi
ex. @charleyoshi

Version History

  • 0.1
    • Initial Release

About

Playing TicTacToe with AI's Adversarial Search Algorithm - Minimax

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages