There are only O O s on the board.(2)

Logic Level 2

O O O O O O O O O \begin{array}{|l|c|r|}\hline O & O & O \\ \hline O & O & O \\ \hline O& O & O \\ \hline \end{array}

There are 9 O O s on the board, as shown. Two players take turns choosing a row or column (no diagonals) and taking away 1 to 3 of the O O s in that row or column. Whoever takes away the last O O loses.

Assuming optimal play, who wins?

The one who goes first The one who goes second

X X by X X , 17, Taiwan

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

The only way the person who goes second could win, would be if the first player took three O's

1 Helpful 0 Interesting 0 Brilliant 0 Confused

only and only if you're not increasing the -3

Elijah Frank - 5 months, 4 weeks ago
Elijah Frank
Dec 13, 2020

You can won in almost all ways, if you have -1 or -2 almost always decrease to the maximum and if you have the maximum (-3) almost always increase.

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...