Guaranteed successful strategies for a square achievement game on an n by n grid

Details Guaranteed successful strategies for a square achievement game on an n by n grid Guaranteed successful strategies for a square achievement game on an n by n grid

2011-09-11

arxiv.org/abs/1109.2341v3

Computer Science

Discrete Mathematics

4 pages, 2 additional files (plain text version and program source)

Scientific paper

At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner." Then he asks "What is the outcome of the game given optimal play?" or "What is the smallest n such that the first player has a winning strategy?" For n lower than 3 a win is obviously impossible. The aim of this article and the additionally (in the source package) provided computer program SQRGAME is to give and prove sure strategies for the second player not to lose if n is 3 or 4, and for the first player to win if n is 5.

Affiliated with

Also associated with

No associations

Rating

Guaranteed successful strategies for a square achievement game on an n by n grid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Guaranteed successful strategies for a square achievement game on an n by n grid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guaranteed successful strategies for a square achievement game on an n by n grid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20263