tic tac toe architecture cse 5290 artificial intelligence 06 13 2011 christopher hepler n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler PowerPoint Presentation
Download Presentation
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler

Loading in 2 Seconds...

play fullscreen
1 / 6

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler - PowerPoint PPT Presentation


  • 62 Views
  • Uploaded on

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler. Processing Steps. Generate Search Tree. Accept User (X) Input. Search branches in current board node. Update current board node based on user’s selection. Computer (O) Turn.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler' - yitta


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
tic tac toe architecture cse 5290 artificial intelligence 06 13 2011 christopher hepler

Tic Tac Toe ArchitectureCSE 5290 – Artificial Intelligence06/13/2011Christopher Hepler

processing steps
Processing Steps

Generate Search Tree

Accept User (X) Input

Search branches in current board node

Update current board node based on user’s selection

Computer (O) Turn

Minimax with Alpha Beta Pruning

Update GUI

Check For Win

Update current board node based on computer’s selection

generate search tree
Generate Search Tree

The search tree is created by recursively filling in a square traversing all the way down each branch. Each level of the search tree alternates between an X and an O.

user x steps
User (X) Steps
  • The user clicks on a button.
  • The user selection is used to find the node in the branch list of the current node.
  • Once the node has been found the current node is updated to the node in the branch list.

Accept User (X) Input

Search branches in current board node

Update current board node based on user’s selection

computer o steps
Computer (O) Steps

Computer (O) Turn

  • The current board state is run through the minimax alpha beta algorithm to determine the best location for the computer to select.
  • Once the location is found the current node is updated to reflect the new board state.

Minimax with Alpha Beta Pruning

Update current board node based on computer’s selection

check for winner
Check for winner

Accept User (X) Input

  • A check is performed to determine if there was a winner in this state.
  • If so then update the GUI.
  • If there was no winner and not a draw the game continues back at the user (X) input.

Update GUI

Check For Win