Numberlink Puzzle

This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.

Problem Connect each two cells with the same numbers by a line. The sections of a line run horizontally or vertically. Each cell must be visited exactly once by a line. Solution The trick is to identify endpoints of numberlinks. They do have only one neighbor with the same value. Cells wich are part of a path must have two neighbors with the same value. The challenge is now to encode this insight…

Problem

1. Connect each two cells with the same numbers by a line.
2. The sections of a line run horizontally or vertically.
3. Each cell must be visited exactly once by a line.

Solution

The trick is to identify endpoints of numberlinks. They do have only one neighbor with the same value. Cells wich are part of a path must have two neighbors with the same value.

The challenge is now to encode this insight into a Mixed Integer Programming model and fire up a solver.

Read on /numberlink-puzzle/ ↗