Dominoes: Difference between revisions

 

=={{header|F_Sharp|F#}}==

// Dominoes: Nigel Galloway. November 17th., 2021.

let cP (n:seq<uint64 list * uint64>) g=seq{for y,n in n do for g in g do let l=n^^^g in if n+g=l then yield (g::y,l)}

2;1;4;3;3;4;6;6;

6;4;5;1;5;4;1;4|]

{{out}}

<pre>

6 4+5 1+5 4 1+4

</pre>

solve [|5;6;2;0;0;4;1;4;

3;6;1;3;0;4;2;2;

4;4;1;3;6;6;0;2;

1;2;6;2;6;5;0;4|]

{{out}}

<pre>

 

=={{header|Julia}}==

0 5 1 3 2 2 3 1;

0 5 5 0 5 2 4 6;

printlayout(first(lays))

println(length(lays), " layouts found.")

<pre>

0+5 1+3 2 2+3 1

</pre>

===Extra credit task ===

The number of ways to cover an m X n rectangle with m * n / 2 dominoes, calculated

independently by Temperley & Fisher (1961) and Kasteleyn (1961), is given by

println("Possible flip configurations: $flips")

println("Possible permuted arrangements with flips: ", flips * arrang * perms)

<pre>

Arrangements ignoring values: 1292697

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

VisualizeState[sol_List, tab_List] := Module[{rects},

rects = Apply[Rectangle[#1 - {1, 1} 0.5, #2 + {1, 1} 0.5] &, sol[[All, 2]], {1}];

sols = FindSolutions[tab];

Length[sols]

{{out}}

<pre>1

 

===Extra credit task ===

DominoTilingCount[m_, n_] := Module[{},

Round[Product[

Print["Permuted arrangements ignoring flipping dominos: ", arrangements*permutations]

Print["Possible flip configurations: ", flips]

{{out}}

<pre>Arrangements ignoring values: 1292697

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Dominoes

find( $x + 1, $y, $new );

}

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #000000;">test</span><span style="color: #0000FF;">(</span><span style="color: #000000;">unpack</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"05132231 05505246 43036620 06235126 11300245 21433466 64515414"</span><span style="color: #0000FF;">))</span>

<span style="color: #000000;">test</span><span style="color: #0000FF;">(</span><span style="color: #000000;">rand_grid</span><span style="color: #0000FF;">())</span>

{{out}}

<pre>

===Extra credit===

Pretty dumb brute force approach, dreadfully slow.

<span style="color: #008080;">without</span> <span style="color: #008080;">js</span> <span style="color: #000080;font-style:italic;">-- too slow</span>

<span style="color: #008080;">enum</span> <span style="color: #000000;">IGNORE</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">CONSIDER</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">NOSYM</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Arrangements ignoring symmetry: %g\n"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">count</span><span style="color: #0000FF;">(</span><span style="color: #000000;">NOSYM</span><span style="color: #0000FF;">))</span>

<span style="color: #0000FF;">?</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

=== Much faster ===

{{trans|Wren}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Possible permuted arrangements with flips: %s\n"</span><span style="color: #0000FF;">,</span> <span style="color: #7060A8;">mpz_get_str</span><span style="color: #0000FF;">(</span><span style="color: #000000;">perms</span><span style="color: #0000FF;">,</span><span style="color: #000000;">10</span><span style="color: #0000FF;">,</span><span style="color: #004600;">true</span><span style="color: #0000FF;">))</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Took %s\n"</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">start</span><span style="color: #0000FF;">))</span>

{{out}}

<pre>

{{trans|Julia}}

===Basic task===

[0, 5, 1, 3, 2, 2, 3, 1],

[0, 5, 5, 0, 5, 2, 4, 6],

System.print("%(lays.count) layout%(pl) found%(fo).")

System.print("Took %(System.clock - start) seconds.\n")

 

{{out}}

{{libheader|Wren-big}}

{{libheader|Wren-fmt}}

import "./fmt" for Fmt

 

Fmt.print("Possible flip configurations: $,i", flips)

Fmt.print("Possible permuted arrangements with flips: $,i", perms * flips * arrang)

 

{{out}}

{{libheader|Wren-gmp}}

This is just to give what will probably be a rare outing to the Mpf class though (despite their usage in the Julia example) we don't need 'big floats' here, just 'big ints'. Slightly slower than the Wren-cli example as a result.

import "./fmt" for Fmt

 

Fmt.print("Possible flip configurations: $,i", flips)

Fmt.print("Possible permuted arrangements with flips: $,i", perms * flips * arrang)

 

{{out}}