Binary Puzzle
Level 7
10 Points
Instruction
Your task is to solve a binary puzzle. Every binary puzzle has exactly one solution, which can be found by applying these rules:
- Every cell must contain either a zero or a one.
- More than two of the same digits can't be adjacent. Thus, if two adjacents cells contain the same digit, the cells next to the digits must contain the other digit.
- Each row and each column must contain an equal number of zeros and ones.
- Each row and column is unique.
You'll get passed in an uncompleted puzzle as rows of zeros and ones, with placeholders (_) for the unknown values.
The goal is to define the rules for the binary puzzle, which will let the tests figure out the values for the placeholders (you don't do that yourselves).
Your implementation must useProlog's Constraint Logic Programming over Finite Domains (CLP(FD)), which is perfect for these types of tasks.
Note
To help you get started, the stub file already includes the clpfd library via:
:- use_module(library(clpfd)).Binary Puzzle
Level 7
10 Points
Instruction
Your task is to solve a binary puzzle. Every binary puzzle has exactly one solution, which can be found by applying these rules:
- Every cell must contain either a zero or a one.
- More than two of the same digits can't be adjacent. Thus, if two adjacents cells contain the same digit, the cells next to the digits must contain the other digit.
- Each row and each column must contain an equal number of zeros and ones.
- Each row and column is unique.
You'll get passed in an uncompleted puzzle as rows of zeros and ones, with placeholders (_) for the unknown values.
The goal is to define the rules for the binary puzzle, which will let the tests figure out the values for the placeholders (you don't do that yourselves).
Your implementation must useProlog's Constraint Logic Programming over Finite Domains (CLP(FD)), which is perfect for these types of tasks.
Note
To help you get started, the stub file already includes the clpfd library via:
:- use_module(library(clpfd)).