Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

So we have numbers 5 rows by 5 columns. Different players have the same table. The numbers on each cell of the tables are different. Different players choose which numbers will be marked.

We select a number. Every number that we select also shows up on opponent screen.

The goal is to make lines, horizontally, vertically, or diagonally. Those who make 5 lines first win.

My strategy is to simply compute "values" in each cells. The value is the number of all other cells that form a line. To provide more incentive to complete cells, lines with many mark already get chosen first.

We can try to complete a line or pick spots with more possible line closing. My algorith is to always pick lines that is the closest to compete. So far, my program can defeat me most of the time.

Is this optimum strategy that can't be defeated?

share|cite|improve this question
Homer Simpson has an optimum strategy, he cheats! :-) – Asaf Karagila Jun 11 '12 at 6:27
You should challenge my algorithm. Coming to android soon. – Jim Thio Jun 11 '12 at 6:29
We make a line by marking every cell in the line. – Jim Thio Jun 12 '12 at 4:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.