Skip to content

Commit 8822a00

Browse files
Add killer-sudoku-helper exercise (#520)
1 parent 075ed54 commit 8822a00

File tree

9 files changed

+347
-0
lines changed

9 files changed

+347
-0
lines changed

config.json

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -795,6 +795,14 @@
795795
"prerequisites": [],
796796
"difficulty": 4
797797
},
798+
{
799+
"slug": "killer-sudoku-helper",
800+
"name": "Killer Sudoku Helper",
801+
"uuid": "2e07e358-7432-484d-83b5-ea813577e1a1",
802+
"practices": [],
803+
"prerequisites": [],
804+
"difficulty": 4
805+
},
798806
{
799807
"slug": "linked-list",
800808
"name": "Linked List",
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
return {
2+
default = {
3+
ROOT = { '.' }
4+
}
5+
}
Lines changed: 85 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,85 @@
1+
# Instructions
2+
3+
A friend of yours is learning how to solve Killer Sudokus (rules below) but struggling to figure out which digits can go in a cage.
4+
They ask you to help them out by writing a small program that lists all valid combinations for a given cage, and any constraints that affect the cage.
5+
6+
To make the output of your program easy to read, the combinations it returns must be sorted.
7+
8+
## Killer Sudoku Rules
9+
10+
- [Standard Sudoku rules][sudoku-rules] apply.
11+
- The digits in a cage, usually marked by a dotted line, add up to the small number given in the corner of the cage.
12+
- A digit may only occur once in a cage.
13+
14+
For a more detailed explanation, check out [this guide][killer-guide].
15+
16+
## Example 1: Cage with only 1 possible combination
17+
18+
In a 3-digit cage with a sum of 7, there is only one valid combination: 124.
19+
20+
- 1 + 2 + 4 = 7
21+
- Any other combination that adds up to 7, e.g. 232, would violate the rule of not repeating digits within a cage.
22+
23+
![Sudoku grid, with three killer cages that are marked as grouped together.
24+
The first killer cage is in the 3×3 box in the top left corner of the grid.
25+
The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 5.
26+
The numbers are highlighted in red to indicate a mistake.
27+
The second killer cage is in the central 3×3 box of the grid.
28+
The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 4.
29+
None of the numbers in this cage are highlighted and therefore don't contain any mistakes.
30+
The third killer cage follows the outside corner of the central 3×3 box of the grid.
31+
It is made up of the following three cells: the top left cell of the cage contains a 2, highlighted in red, and a cage sum of 7.
32+
The top right cell of the cage contains a 3.
33+
The bottom right cell of the cage contains a 2, highlighted in red. All other cells are empty.][one-solution-img]
34+
35+
## Example 2: Cage with several combinations
36+
37+
In a 2-digit cage with a sum 10, there are 4 possible combinations:
38+
39+
- 19
40+
- 28
41+
- 37
42+
- 46
43+
44+
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled.
45+
Each continguous two rows form a killer cage and are marked as grouped together.
46+
From top to bottom: first group is a cell with value 1 and a pencil mark indicating a cage sum of 10, cell with value 9.
47+
Second group is a cell with value 2 and a pencil mark of 10, cell with value 8.
48+
Third group is a cell with value 3 and a pencil mark of 10, cell with value 7.
49+
Fourth group is a cell with value 4 and a pencil mark of 10, cell with value 6.
50+
The last cell in the column is empty.][four-solutions-img]
51+
52+
## Example 3: Cage with several combinations that is restricted
53+
54+
In a 2-digit cage with a sum 10, where the column already contains a 1 and a 4, there are 2 possible combinations:
55+
56+
- 28
57+
- 37
58+
59+
19 and 46 are not possible due to the 1 and 4 in the column according to standard Sudoku rules.
60+
61+
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled.
62+
The first row contains a 4, the second is empty, and the third contains a 1.
63+
The 1 is highlighted in red to indicate a mistake.
64+
The last 6 rows in the column form killer cages of two cells each.
65+
From top to bottom: first group is a cell with value 2 and a pencil mark indicating a cage sum of 10, cell with value 8.
66+
Second group is a cell with value 3 and a pencil mark of 10, cell with value 7.
67+
Third group is a cell with value 1, highlighted in red, and a pencil mark of 10, cell with value 9.][not-possible-img]
68+
69+
## Trying it yourself
70+
71+
If you want to give an approachable Killer Sudoku a go, you can try out [this puzzle][clover-puzzle] by Clover, featured by [Mark Goodliffe on Cracking The Cryptic on the 21st of June 2021][goodliffe-video].
72+
73+
You can also find Killer Sudokus in varying difficulty in numerous newspapers, as well as Sudoku apps, books and websites.
74+
75+
## Credit
76+
77+
The screenshots above have been generated using [F-Puzzles.com](https://www.f-puzzles.com/), a Puzzle Setting Tool by Eric Fox.
78+
79+
[sudoku-rules]: https://masteringsudoku.com/sudoku-rules-beginners/
80+
[killer-guide]: https://masteringsudoku.com/killer-sudoku/
81+
[one-solution-img]: https://assets.exercism.org/images/exercises/killer-sudoku-helper/example1.png
82+
[four-solutions-img]: https://assets.exercism.org/images/exercises/killer-sudoku-helper/example2.png
83+
[not-possible-img]: https://assets.exercism.org/images/exercises/killer-sudoku-helper/example3.png
84+
[clover-puzzle]: https://app.crackingthecryptic.com/sudoku/HqTBn3Pr6R
85+
[goodliffe-video]: https://youtu.be/c_NjEbFEeW0?t=1180
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
{
2+
"authors": [
3+
"keiravillekode"
4+
],
5+
"files": {
6+
"solution": [
7+
"killer-sudoku-helper.lua"
8+
],
9+
"test": [
10+
"killer-sudoku-helper_spec.lua"
11+
],
12+
"example": [
13+
".meta/example.lua"
14+
]
15+
},
16+
"blurb": "Write a tool that makes it easier to solve Killer Sudokus",
17+
"source": "Created by Sascha Mann, Jeremy Walker, and BethanyG for the Julia track on Exercism.",
18+
"source_url": "https://github.com/exercism/julia/pull/413"
19+
}
Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
local function clone(original)
2+
local result = {}
3+
for k, v in ipairs(original) do
4+
result[k] = v
5+
end
6+
return result
7+
end
8+
9+
local function combinations(sum, size, exclude)
10+
local excluded = {}
11+
local result = {}
12+
local combination = {}
13+
14+
if exclude then
15+
for _, v in ipairs(exclude) do
16+
excluded[v] = true
17+
end
18+
end
19+
20+
local function search(total, count, start)
21+
if count == 0 then
22+
if total == 0 then
23+
table.insert(result, clone(combination))
24+
end
25+
26+
return
27+
end
28+
29+
for number = start, 9 do
30+
if not excluded[number] then
31+
combination[size - count + 1] = number
32+
search(total - number, count - 1, number + 1)
33+
end
34+
end
35+
end
36+
37+
search(sum, size, 1)
38+
return result
39+
end
40+
41+
return { combinations = combinations }
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
local map = function(t, f)
2+
local mapped = {}
3+
for i, v in ipairs(t) do
4+
mapped[i] = f(v)
5+
end
6+
return mapped
7+
end
8+
9+
local function render_solutions(solutions)
10+
return table.concat(map(solutions, function(solution)
11+
return '{' .. table.concat(solution, ', ') .. '}, --'
12+
end), '\n')
13+
end
14+
15+
local function render_optional_exclude(exclude)
16+
if #exclude == 0 then
17+
return ''
18+
end
19+
20+
return ', {' .. table.concat(exclude, ', ') .. '}'
21+
end
22+
23+
return {
24+
module_name = 'killer_sudoku_helper',
25+
26+
generate_test = function(case)
27+
local template = [[
28+
local expected = {
29+
%s
30+
}
31+
assert.are.same(expected, killer_sudoku_helper.combinations(%d, %d%s))]]
32+
return template:format(render_solutions(case.expected), case.input.cage.sum, case.input.cage.size,
33+
render_optional_exclude(case.input.cage.exclude))
34+
end
35+
}
Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
# This is an auto-generated file.
2+
#
3+
# Regenerating this file via `configlet sync` will:
4+
# - Recreate every `description` key/value pair
5+
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
6+
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
7+
# - Preserve any other key/value pair
8+
#
9+
# As user-added comments (using the # character) will be removed when this file
10+
# is regenerated, comments can be added via a `comment` key.
11+
12+
[2aaa8f13-11b5-4054-b95c-a906e4d79fb6]
13+
description = "Trivial 1-digit cages -> 1"
14+
15+
[4645da19-9fdd-4087-a910-a6ed66823563]
16+
description = "Trivial 1-digit cages -> 2"
17+
18+
[07cfc704-f8aa-41b2-8f9a-cbefb674cb48]
19+
description = "Trivial 1-digit cages -> 3"
20+
21+
[22b8b2ba-c4fd-40b3-b1bf-40aa5e7b5f24]
22+
description = "Trivial 1-digit cages -> 4"
23+
24+
[b75d16e2-ff9b-464d-8578-71f73094cea7]
25+
description = "Trivial 1-digit cages -> 5"
26+
27+
[bcbf5afc-4c89-4ff6-9357-07ab4d42788f]
28+
description = "Trivial 1-digit cages -> 6"
29+
30+
[511b3bf8-186f-4e35-844f-c804d86f4a7a]
31+
description = "Trivial 1-digit cages -> 7"
32+
33+
[bd09a60d-3aca-43bd-b6aa-6ccad01bedda]
34+
description = "Trivial 1-digit cages -> 8"
35+
36+
[9b539f27-44ea-4ff8-bd3d-c7e136bee677]
37+
description = "Trivial 1-digit cages -> 9"
38+
39+
[0a8b2078-b3a4-4dbd-be0d-b180f503d5c3]
40+
description = "Cage with sum 45 contains all digits 1:9"
41+
42+
[2635d7c9-c716-4da1-84f1-c96e03900142]
43+
description = "Cage with only 1 possible combination"
44+
45+
[a5bde743-e3a2-4a0c-8aac-e64fceea4228]
46+
description = "Cage with several combinations"
47+
48+
[dfbf411c-737d-465a-a873-ca556360c274]
49+
description = "Cage with several combinations that is restricted"
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
local function combinations(sum, size, exclude)
2+
3+
end
4+
5+
return { combinations = combinations }
Lines changed: 100 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,100 @@
1+
local killer_sudoku_helper = require('killer-sudoku-helper')
2+
3+
describe('killer-sudoku-helper', function()
4+
describe('trivial 1-digit cages', function()
5+
it('1', function()
6+
local expected = {
7+
{ 1 } --
8+
}
9+
assert.are.same(expected, killer_sudoku_helper.combinations(1, 1))
10+
end)
11+
12+
it('2', function()
13+
local expected = {
14+
{ 2 } --
15+
}
16+
assert.are.same(expected, killer_sudoku_helper.combinations(2, 1))
17+
end)
18+
19+
it('3', function()
20+
local expected = {
21+
{ 3 } --
22+
}
23+
assert.are.same(expected, killer_sudoku_helper.combinations(3, 1))
24+
end)
25+
26+
it('4', function()
27+
local expected = {
28+
{ 4 } --
29+
}
30+
assert.are.same(expected, killer_sudoku_helper.combinations(4, 1))
31+
end)
32+
33+
it('5', function()
34+
local expected = {
35+
{ 5 } --
36+
}
37+
assert.are.same(expected, killer_sudoku_helper.combinations(5, 1))
38+
end)
39+
40+
it('6', function()
41+
local expected = {
42+
{ 6 } --
43+
}
44+
assert.are.same(expected, killer_sudoku_helper.combinations(6, 1))
45+
end)
46+
47+
it('7', function()
48+
local expected = {
49+
{ 7 } --
50+
}
51+
assert.are.same(expected, killer_sudoku_helper.combinations(7, 1))
52+
end)
53+
54+
it('8', function()
55+
local expected = {
56+
{ 8 } --
57+
}
58+
assert.are.same(expected, killer_sudoku_helper.combinations(8, 1))
59+
end)
60+
61+
it('9', function()
62+
local expected = {
63+
{ 9 } --
64+
}
65+
assert.are.same(expected, killer_sudoku_helper.combinations(9, 1))
66+
end)
67+
end)
68+
69+
it('cage with sum 45 contains all digits 1:9', function()
70+
local expected = {
71+
{ 1, 2, 3, 4, 5, 6, 7, 8, 9 } --
72+
}
73+
assert.are.same(expected, killer_sudoku_helper.combinations(45, 9))
74+
end)
75+
76+
it('cage with only 1 possible combination', function()
77+
local expected = {
78+
{ 1, 2, 4 } --
79+
}
80+
assert.are.same(expected, killer_sudoku_helper.combinations(7, 3))
81+
end)
82+
83+
it('cage with several combinations', function()
84+
local expected = {
85+
{ 1, 9 }, --
86+
{ 2, 8 }, --
87+
{ 3, 7 }, --
88+
{ 4, 6 } --
89+
}
90+
assert.are.same(expected, killer_sudoku_helper.combinations(10, 2))
91+
end)
92+
93+
it('cage with several combinations that is restricted', function()
94+
local expected = {
95+
{ 2, 8 }, --
96+
{ 3, 7 } --
97+
}
98+
assert.are.same(expected, killer_sudoku_helper.combinations(10, 2, { 1, 4 }))
99+
end)
100+
end)

0 commit comments

Comments
 (0)