Numberlink is a popular game and has been adapted in many Android and Windows Applications. This is an implementation of the game in C.
Consider an n × n array of squares. Some of the squares are empty, some are solid, and some nonsolid squares are marked by integers 1, 2, 3, … Each integer occupies exactly two different squares on the board. The task of the player is to connect the two occurrences of each integer on the board by a simple path using horizontal and vertical movements alone. No two different paths are allowed to intersect one another. No path may include any solid square (solid squares are forbidden to appear on any path). Finally, all nonsolid squares must be filled by the paths.
- The code builds the puzzle board on a grid whose size is entered by the user.
- It generates the maximum possible number of paths and numbers them.
- The program also gives a possible solution for the generated puzzle.
- Refer to FLOWNumberLink.pdf for more details.
Adding a makefile.