The object is to click as many light blue circles as possible. When clicked, the circle becomes black. Circles you can not click turn green, while clickable circles turn light blue.

For your first move, you can click on any circle. Thereafter, you can only click on adjacent light blue circles. After the first move, the next N moves (where N is the game size) must travel toward each edge of the triangle equal to the distance to the edge of the initial circle. The number of remaining moves toward each edge appears beside each edge.

>Unfortunately, the circles change color according to some initially incomprehensible rules. Imagine that you are a tourist in a triangular city, and and your goal is to visit as much of the city as possible without ever visiting the same place twice. The cities subway system is run by the three neighboring countries, and spending a valid ticket issued by that country entitles you to ride one step closer to the border of that country, and at the end of that trip the country whose border you ended up further away from will issue you a ticket that will become valid in n days from now. As soon as you choose the start of your tour each country will issue you just enough valid tickets to reach that country's border (you will get n tickets total)

This fantasy translates into the following: For your first move you can click on any of the circles. Thereafter you can only move to an adjacent circle, but not all adjacent circles are possible. Note that any move between two adjacent circles moves closer to one edge of the triangle, further from another and parallel to a third. (For the smaller games, the circle is labeled with the distance to the edges.)

After the first move, the next n moves, where n is the game size, must altogether have moves toward each edge equal to the distance to the edge of the initial circle. (The number of remaining moves toward each edge are written next to that edge.

After the first n moves, each move must move toward the edge that the move n moves ago moved away from. (The move n moves ago is highlighted in blue.)

The known best possible scores are: