Monster Go

Monster Go is a "Grid-Filling Flow Puzzle." The technical core is "Planar Graph Logic." You must connect matching pairs of monsters with a line. The constraint is strict: lines cannot cross, and the entire grid must be filled. It tests "Topological Reasoning"—visualizing how to route multiple distinct paths through a confined space without creating isolated "Dead Zones."

You see a grid with pairs of colored monsters. Your goal is to link them. Interaction is "Draw-to-Connect." Trace a path from Monster A to Monster A. Repeat for all pairs. Condition: You must visit every single square on the grid. If you connect all pairs but leave one square empty, the level is failed.

Solving hard grids depends on "Perimeter Routing." Always route lines along the "Outer Edges" first. This preserves the "Central Hub" for the most difficult cross-over connections. A pro strategy is to identify "Corner-Locked" monsters—if a monster is in a corner, it has only one valid exit direction. Draw that line immediately to reduce the puzzle's variables.