Based off of this.

Lets say you have two players, Red and Blue, that alternate filling an arbitrarily large hexagonal grid of tessellated hexagons with pieces of their color. Hexagons can either be filled or empty. A piece maybe be placed on an empty hexagon (filling it) as long as that empty hexagon meets BOTH of these conditions:

  1. No more than two filled adjacencies.
  2. The filled adjacencies contain an equal number of Red and Blue pieces.

Is there a way to fill up the grid completely?


1 Answer 1


I claim the answer is



the last cell you fill must have at least 3 adjacent already-filled cells.

  • $\begingroup$ How did I miss this...... $\endgroup$
    – Sunny Lu
    Apr 1 at 23:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.