Squares! is essentially a grid of points that create a Directed Graph. A Directed Graph represents a path from Point A to Point B. In this respect, Squares! a bunch of Point As to Point Bs. Each square is a starting point, but not necessarily an ending point.
That’s the game. Find the most efficient paths so you only visit each square at most once. The twist is that each time you pass through a square, the path can change and new longer paths may show up.
For example, lets look at the following simple grid:
 If you follow the path from the top left to the bottom right … |
 … then start working your way backward … |
 … toward the top left … |
 … until you end up … |
 … back up at the top! |
Here’s a screenshot describing how the squares will flip as they go off-screen:
A will flip 1
B will flip 2
C will flip 3
D will flip 4
E will flip 5
Rotate the picture 90 degrees and the same rules apply for flipping top to bottom and bottom to top.