-
-
Notifications
You must be signed in to change notification settings - Fork 655
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Sync the
zebra-puzzle
exercise's docs with the latest data. (#2781)
- Loading branch information
1 parent
1b3026b
commit f9832c0
Showing
2 changed files
with
27 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,15 @@ | ||
# Introduction | ||
|
||
The Zebra Puzzle is a famous logic puzzle in which there are five houses, each painted a different color. | ||
The houses have different inhabitants, who have different nationalities, own different pets, drink different beverages and smoke different brands of cigarettes. | ||
|
||
To help you solve the puzzle, you're given 15 statements describing the solution. | ||
However, only by combining the information in _all_ statements will you be able to find the solution to the puzzle. | ||
|
||
~~~~exercism/note | ||
The Zebra Puzzle is a [Constraint satisfaction problem (CSP)][constraint-satisfaction-problem]. | ||
In such a problem, you have a set of possible values and a set of constraints that limit which values are valid. | ||
Another well-known CSP is Sudoku. | ||
[constraint-satisfaction-problem]: https://en.wikipedia.org/wiki/Constraint_satisfaction_problem | ||
~~~~ |