Solve the no connection puzzle: Difference between revisions
Content added Content deleted
| Line 1,263: | Line 1,263: | ||
const HOLES = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H'] |
const HOLES = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H'] |
||
const PEGS = [1, 2, 3, 4, 5, 6, 7, 8] |
const PEGS = [1, 2, 3, 4, 5, 6, 7, 8] |
||
const EDGES = [('A', 'C'), ('A', 'D'), ('A', 'E'), |
const EDGES = [('A', 'C'), ('A', 'D'), ('A', 'E'), |
||
('B', 'D'), ('B', 'E'), ('B', 'F'), |
('B', 'D'), ('B', 'E'), ('B', 'F'), |
||
| Line 1,275: | Line 1,273: | ||
goodtrials = Array{Vector{Int},1}() |
goodtrials = Array{Vector{Int},1}() |
||
for perm in permutations(PEGS) |
for perm in permutations(PEGS) |
||
trial = Dict() |
|||
for (i, p) in enumerate(perm) |
|||
trial[HOLES[i]] = p |
|||
end |
|||
goodtrial = true |
goodtrial = true |
||
for edge in EDGES |
for edge in EDGES |
||
if abs( |
if abs(perm[edge[1] - 'A' + 1] - perm[edge[2] - 'A' + 1]) < 2 |
||
goodtrial = false |
goodtrial = false |
||
break |
break |
||
| Line 1,330: | Line 1,324: | ||
5 6 |
5 6 |
||
</pre> |
</pre> |
||
=={{header|Kotlin}}== |
=={{header|Kotlin}}== |
||