Win_odd Dhamnekar
Junior Member
- Joined
- Aug 14, 2018
- Messages
- 207
Hello,
Two robots play a game of tic-tac-toe. They choose their moves randomly. Let E denote the expected number of moves it would take for the robots to finish a game. Find 1000E rounded to the nearest integer.
Note: A move is defined as the action of one of the robots placing one X or one O. The game finishes after 9 moves no matter the result.
Solution:- I found it difficult to answer this question because it involves very complicated computations. If any member can answer this question in a step by step and easy to understand way, may reply with correct answer.
Two robots play a game of tic-tac-toe. They choose their moves randomly. Let E denote the expected number of moves it would take for the robots to finish a game. Find 1000E rounded to the nearest integer.
Note: A move is defined as the action of one of the robots placing one X or one O. The game finishes after 9 moves no matter the result.
Solution:- I found it difficult to answer this question because it involves very complicated computations. If any member can answer this question in a step by step and easy to understand way, may reply with correct answer.