The player should fill a square grid N*N with numbers from 0:(X-1), where X<N. Rows and columns should be unique, and each row at index i should be equal to a column at index j, with i not equal j. Implemented with Prolog.
omarsawan / helsinki-puzzle Goto Github PK
View Code? Open in Web Editor NEWThe player should fill a square grid N*N with numbers from 0:(X-1), where X<N. Rows and columns should be unique, and each row at index i should be equal to a column at index j, with i not equal j. Implemented with Prolog.