Skip to content

A program solving logic puzzle: having a N x N grid, the goal is to fill each cell of the grid meeting the requirements of the puzzle.

Notifications You must be signed in to change notification settings

abdallahabdellatif/Helsinki-Puzzle

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Description

Given a square grid of size N, where the horizontal rows are numbered 1 to N from top to bottom and the vertical columns are numbered 1 to N from left to right. You must place a number in each cell of the N by N grid such that :-

  • Each row is unique.

  • Each row is exactly equal to one of the columns, however, it must not be the column with the same index as the row.

  • If X is the largest number you place in the grid, then you must also place 1,2,...,X-1, where the condition X <= N is satisfied.

For a 3 x 3 grid, you may have the following matrix

c1 c2 c3
r1 2 1 2
r2 2 2 1
r3 1 2 2

defined by the following equalities

c1 = r2
c2 = r3
c3 = r1

For a 4 x 4 grid, you may have the following matrix

c1 c2 c3 c4
r1 1 2 3 1
r2 3 4 4 2
r3 2 4 4 3
r4 1 3 2 1

defined by the following equalities

c1 = r4
c2 = r3
c3 = r2
c4 = r1

About

A program solving logic puzzle: having a N x N grid, the goal is to fill each cell of the grid meeting the requirements of the puzzle.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Prolog 100.0%