From 8b8204539fff6f7c4380970652a1c7f104fbe915 Mon Sep 17 00:00:00 2001 From: mk-mxp <55182845+mk-mxp@users.noreply.github.com> Date: Wed, 17 Apr 2024 17:02:20 +0200 Subject: [PATCH 1/2] Zebra puzzle link rendering --- exercises/zebra-puzzle/introduction.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/exercises/zebra-puzzle/introduction.md b/exercises/zebra-puzzle/introduction.md index c8b7ef751e..0855b8dedc 100644 --- a/exercises/zebra-puzzle/introduction.md +++ b/exercises/zebra-puzzle/introduction.md @@ -10,5 +10,6 @@ However, only by combining the information in _all_ statements will you be able 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 ~~~~ + +[constraint-satisfaction-problem]: https://en.wikipedia.org/wiki/Constraint_satisfaction_problem From 30fe6a1eff4b9687bad2deb1061ff48f202c3b00 Mon Sep 17 00:00:00 2001 From: mk-mxp <55182845+mk-mxp@users.noreply.github.com> Date: Thu, 18 Apr 2024 06:47:13 +0200 Subject: [PATCH 2/2] Update introduction.md --- exercises/zebra-puzzle/introduction.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/zebra-puzzle/introduction.md b/exercises/zebra-puzzle/introduction.md index 0855b8dedc..33d688fd51 100644 --- a/exercises/zebra-puzzle/introduction.md +++ b/exercises/zebra-puzzle/introduction.md @@ -10,6 +10,6 @@ However, only by combining the information in _all_ statements will you be able 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 +~~~~