All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
Tic Tac Toe (Posted on 2002-09-27) Difficulty: 3 of 5
A computer science teacher poses his students a problem.

"I want you write a computer program that plays tic-tac-toe legally and runs through ALL the possible combinations of the game, and finds out the total."

The students settle down to work..

An hour later, a student gets up and proclaims "I've got it! The number of possible combinations in a game is 344,242."

At which point another student quickly replies, "I haven't finished yet, but I'm sure Fred made a mistake in his program."

Why?

(Tic Tac Toe = Noughts and Crosses)

See The Solution Submitted by Cheradenine    
Rating: 3.5455 (11 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips an itemized result Comment 12 of 12 |
This article by Steve Shaffer on mathrec.org discusses various ways to count and arrives at a few different totals:

255,168 different sequences of moves
31,896 different sequences after eliminating reflections and rotations of the final positions
26,830 possible games if two games are the same when the players faced the same choices at each move of the game (i.e., considering symmetry at each step of the game.)
23,129 possible games under the same symmetry restrictions, if the players quit when the outcome is determined.
  


  Posted by Ady TZIDON on 2015-07-25 02:30:52
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information