Solve the no connection puzzle: Difference between revisions

Content added Content deleted
(Updated second D entry)
(Updated D entry)
Line 276:
 
enum Peg { A, B, C, D, E, F, G, H }
// immutable Peg[2][$] connections =
immutable Peg[2][15] connections =
[[Peg.A, Peg.C], [Peg.A, Peg.D], [Peg.A, Peg.E],
[Peg.B, Peg.D], [Peg.B, Peg.E], [Peg.B, Peg.F],
Line 295 ⟶ 294:
G H";
 
// Peg[$] perm = [EnumMembers!Peg];
Peg[EnumMembers!Peg.length] perm = [EnumMembers!Peg];
do if (connections[].all!(con => abs(perm[con[0]] - perm[con[1]]) > 1))
return board.tr("ABCDEFGH", "%(%d%)".format(perm)).writeln;
Retrieved from "https://rosettacode.org/wiki/Solve_the_no_connection_puzzle"