Explora 8 formas distintas de encontrar la solución del Zebra Puzzle entre 24 mil millones de soluciones posibles, como descartar las permutaciones inválidas lo antes posible, el algoritmo AC-3, una solución basada en lógica muy concisa e incluso un algoritmo genético.
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 enjoy different hobbies.
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.
The Zebra Puzzle is a Constraint satisfaction problem (CSP). 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.
Your task is to solve the Zebra Puzzle to find the answer to these two questions:
The following 15 statements are all known to be true:
Additionally, each of the five houses is painted a different color, and their inhabitants are of different national extractions, own different pets, drink different beverages and engage in different hobbies.
There are 24 billion (5!⁵ = 24,883,200,000) possible solutions, so try ruling out as many solutions as possible.
Todavía no lo has completado en ningún lenguaje.