Solve the no connection puzzle: Difference between revisions
Content added Content deleted
(Updated D entry) |
(Updated first D entry) |
||
Line 276: | Line 276: | ||
enum Peg { A, B, C, D, E, F, G, H } |
enum Peg { A, B, C, D, E, F, G, H } |
||
immutable Peg[2][ |
immutable Peg[2][15] connections = |
||
[[Peg.A, Peg.C], [Peg.A, Peg.D], [Peg.A, Peg.E], |
[[Peg.A, Peg.C], [Peg.A, Peg.D], [Peg.A, Peg.E], |
||
[Peg.B, Peg.D], [Peg.B, Peg.E], [Peg.B, Peg.F], |
[Peg.B, Peg.D], [Peg.B, Peg.E], [Peg.B, Peg.F], |
||
Line 294: | Line 294: | ||
G H"; |
G H"; |
||
Peg[ |
Peg[EnumMembers!Peg.length] perm = [EnumMembers!Peg]; |
||
do if (connections[].all!(con => abs(perm[con[0]] - perm[con[1]]) > 1)) |
do if (connections[].all!(con => abs(perm[con[0]] - perm[con[1]]) > 1)) |
||
return board.tr("ABCDEFGH", "%(%d%)".format(perm)).writeln; |
return board.tr("ABCDEFGH", "%(%d%)".format(perm)).writeln; |