Problem #91: Counting Filled Tic-Tac-Toe Boards

  • Thread starter Thread starter Jameson
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on the combinatorial problem of counting the total number of filled Tic-Tac-Toe boards, specifically a 3x3 grid. The solution requires calculating the arrangements of X's and O's, with the stipulation that X always plays first, resulting in one more X than O on the board. The final count of unique filled boards, without considering winning combinations or board symmetries, is derived from combinatorial mathematics.

PREREQUISITES
  • Understanding of combinatorial mathematics
  • Familiarity with Tic-Tac-Toe game rules
  • Basic knowledge of permutations and combinations
  • Experience with mathematical problem-solving techniques
NEXT STEPS
  • Research combinatorial counting methods in game theory
  • Explore advanced Tic-Tac-Toe strategies and outcomes
  • Learn about symmetry in combinatorial problems
  • Study the application of permutations in game design
USEFUL FOR

Mathematicians, game theorists, computer scientists, and anyone interested in combinatorial problem-solving and game design principles.

Jameson
Insights Author
Gold Member
MHB
Messages
4,533
Reaction score
13
A standard tic-tac-toe board (or noughts and crosses) is a 3x3 grid, with 9 total spaces.

View attachment 1796
There are many different ways that the X's and O's can be placed on the board. If we ignore for now the rule that 3 pieces of one type in a row wins, how many ways can we fill the board completely? Assume that the same piece, X or O, plays first each time so you will always have 1 more of that piece than the other.

Note: The problem isn't to count moves that lead to a certain position. 1 filled board can be reached many ways. Just count the number of total filled boards. Also, don't worry about rotations or reflections for you guys who are more advanced.
--------------------
 

Attachments

  • Tic_tac_toe.png
    Tic_tac_toe.png
    2 KB · Views: 132
Physics news on Phys.org
Congratulations to the following members for their correct solutions:

1) MarkFL

Solution (from MarkFL):
This problem boils down to looking at how many ways to choose 9 things 5 at a time, or equivalently, how to choose 9 things 4 at a time. Thus, the number $N$ of distinct filled boards is given by:

$$N={9 \choose 5}={9 \choose 4}=\frac{9!}{4!\cdot5!}=\frac{9\cdot8\cdot7\cdot6}{4\cdot3\cdot2}=9\cdot7\cdot2=14(10-1)=140-14=126$$

Thus, we find there are 126 distinct filled boards.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
6K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
10K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 32 ·
2
Replies
32
Views
15K