Skip to content

kayo09/tictactoe

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tic Tac Toe

The entireity of the game is stored inside of an array.

setup: -board is printed using printBoard() method -game state is represented using a bool called "over"

data structure: -arrays -Trees

approach

-setup the board while(game!=finished or draw): -readyPlayerOne() ->Strategy(): -maximize the score -printBoard() -readyPlayerTwo() ->Strategy(): -minimize the score

algorithms

min-max: minimizes the loss for the worst case

Notes:

About

This repository contains an implementation of a Tic-Tac-Toe game with an AI opponent using the minimax algorithm. The AI is designed to play optimally, ensuring it never loses a game.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages