About this game Mulkko
Development notes
Par comes from the solver
engine.js holds a shortest-path solver where a move costs 1 and a wait 0, discarding states that have leaked or stalled. Each stage’s par is its minimum, and each stage stores one shortest route. The tests replay all 33 routes and fail if any doesn’t win in exactly par moves, so editing a map means re-solving it.
Ordering stages by solver effort
I rank difficulty by how many states the solver explores. Two Paddies, One Gate (about 600,000 states) and The Channel Across (about 2.1 million) once closed chapter 1 as the hardest stages in the game; since their mechanics all appear earlier, they moved to just before the finale. A test now fails if a stage’s par exceeds the longest of the next three in its chapter by more than 25%.
Turning the solver into a hint
Help used to be one fixed hint per stage, with no warning that a channel pushed into a wall had sunk the attempt. Stuck? runs the solver in 12 ms slices so the board keeps animating. On the stored route it answers instantly; off it, it searches up to 200,000 states and, from a dead state, steps back to the nearest winnable one. If a board is too large to settle, it returns you to where you left the stored route, which is always winnable.
Feedback that keeps the board visible
The fail card used to cover the red tile it described. When the board box is at least 880 px wide, result cards now sit beside the board. On a win, light runs from spring to paddies before the card appears, and each filled paddy plays the next note of a pentatonic scale, synthesized in Web Audio with no sound files. Reduced motion skips the ripples and light.
Updated: