Solve the no connection puzzle: Difference between revisions
Add C# implementation
No edit summary |
(Add C# implementation) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1,126:
2 8 1 7
4 3</pre>
=={{header|C#}}==
{{trans|Java}}
<syntaxhighlight lang="C#">
using System;
using System.Collections.Generic;
using System.Linq;
public class NoConnection
{
// adopted from Go
static int[][] links = new int[][] {
new int[] {2, 3, 4}, // A to C,D,E
new int[] {3, 4, 5}, // B to D,E,F
new int[] {2, 4}, // D to C, E
new int[] {5}, // E to F
new int[] {2, 3, 4}, // G to C,D,E
new int[] {3, 4, 5}, // H to D,E,F
static int[] pegs = new int[8];
public static void Main(string[] args)
{
List<int> vals = Enumerable.Range(1, 8).ToList();
Random rng = new Random();
vals = vals.OrderBy(a => rng.Next()).ToList();
for (int i = 0; i < pegs.Length; i++)
pegs[i] = vals[i];
} while (!Solved());
PrintResult();
}
static bool Solved()
{
for (int i = 0; i < links.Length; i++)
foreach (int peg in links[i])
if (Math.Abs(pegs[i] - peg) == 1)
return false;
return true;
}
static void PrintResult()
{
Console.WriteLine($" {pegs[0]} {pegs[1]}");
Console.WriteLine($"{pegs[2]} {pegs[3]} {pegs[4]} {pegs[5]}");
Console.WriteLine($" {pegs[6]} {pegs[7]}");
}
}
</syntaxhighlight>
{{out}}
<pre>
6 1
4 3 8 7
2 5
</pre>
=={{header|C++}}==
Line 2,564 ⟶ 2,626:
=={{header|jq}}==
{{works with|jq|1.
'''Also works with gojq, the Go implementation of jq'''
We present a generate-and-test solver for a slightly more general version of the problem, in which there are N pegs and holes, and in which the connectedness of holes is defined by an array such that holes i and j are connected if and only if [i,j] is a member of the
array.
Line 2,574 ⟶ 2,638:
'''Part 1: Generic functions'''
<syntaxhighlight lang="jq">
# permutations of 0 .. (n-1) inclusive▼
▲ . as $ix
▲ else false
▲ end;
▲# permutations of 0 .. (n-1)
def permutations(n):
# Given a single array, generate a stream by inserting n at different positions:
Line 2,597 ⟶ 2,651:
# Count the number of items in a stream
def count(f): reduce f as $_ (0; .+1);
</syntaxhighlight>
'''Part 2: The no-connections puzzle for N pegs and holes'''
<syntaxhighlight lang="jq">
# Generate a stream of solutions.
# Input should be the connections array, i.e. an array of [i,j] pairs;
# N is the number of pegs and holds.
Line 2,609 ⟶ 2,664:
def ok(connections):
. as $p
|
. as $connections | permutations(N) | select(ok($connections));
</syntaxhighlight>
'''Part 3: The 8-peg no-connection puzzle'''
<syntaxhighlight lang="jq">
# The connectedness matrix
# In this table, 0 represents "A", etc, and an entry [i,j]
# signifies that the holes with indices i and j are connected.
Line 2,653 ⟶ 2,710:
# To count the number of solutions:
# count(solve)
# => 16
▲one(solve) | pp
</syntaxhighlight>
{{
<pre>
5 6
/|\ /|\
Line 2,672 ⟶ 2,725:
\ | X | /
\|/ \|/
3 4
</pre>
=={{header|Julia}}==
Line 4,244 ⟶ 4,298:
{{trans|Kotlin}}
{{libheader|Wren-dynamic}}
<syntaxhighlight lang="
var Solution = Tuple.create("Solution", ["p", "tests", "swaps"])
| |||