You get a 9x9 map with one power plant, three houses, and terrain obstacles, and the goal is to connect the power plant to the houses with an optimal path.
Beneath the coat of paint, it’s a graph theory optimization puzzle, very nearly a Steiner-tree puzzle. Any two nodes within Chebyshev distance 2 are wired together automatically. But the wires travel in Euclidian space, so reach is measured on a square and wire on a circle. The skill is balancing that asymmetry to find the shortest route to light up the whole map.
Because the original goal of this project was to provide joy to my son, I’ve done my best to make it accessible to everyone. It’s localized into 18 languages so far, has a high-contrast mode meeting AAA standards, reduced motion mode, etc.
I do collect usage telemetry to help me improve the game, but I’ve done my very best to take privacy very seriously, collecting anonymous stats about the gameplay itself, with a random id the game generates rather than anything about the player or device. I also generate the privacy policy directly from the analytics code, as a contract to ensure nothing is ever collected without being fully disclosed.
I had a really great time with this project, and hope to continue to improve it! I’d love any feedback I can get! Please let me know if you have any questions, and I’ll stick around to answer them!