/minimax

Tic Tac Toe Intelligent Agent with Minimax Algorithm (CSCI 404 - Machine Intelligence)

Primary LanguageC#MIT LicenseMIT

Tic Tac Toe Intelligent Agent with Minimax

This project is from Claflin University's CSCI 404 - Machine Intelligence taught by Dr. Karina Liles. I stumbled on the question and thought it would be a fun project to work on. I'm working with C# because I just picked up the langauge and I'm trying to get my feet wet.

Question

Write a program that creates a tic tac toe game with two players. Each round the game prints the board using _ for an empty space, X for Player 1, and O for Player 2. The game should ask Player 1 to enter two integers to represent the coordinates to place X. The computer will be player O and will automatically play after Player 1.

Develop an intelligent agent that will beat Player 1.

Note: Use a multi-dimensional array to store the game board.

Sample board after round 1:

Sample Board

After each round, your game must:

  1. Print the board
  2. Check for a winner

A player wins if they have 3 in a row (vertically, horizonatally, or diagonally).

Rubric

You will be graded on your agent's ability to win the game.

0 points 1 point 2 points 3 points 4 points
Intelligent Agent 0 wins 1 win 2 wins 3 wins 4 wins