Dominoes: Difference between revisions

Line 21:

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

<~~lang~~ fsharp>

// 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)}

Line 36:

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

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

</syntaxhighlight>

</lang>

<pre>

Line 53:

6 4+5 1+5 4 1+4

</pre>

<~~lang~~ fsharp>

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

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

Line 61:

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

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

</syntaxhighlight>

</lang>

<pre>

Line 80:

=={{header|Julia}}==

<~~lang~~ julia>const tableau = [

<syntaxhighlight lang="julia">const tableau = [

0 5 1 3 2 2 3 1;

0 5 5 0 5 2 4 6;

Line 166:

printlayout(first(lays))

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

</~~lang~~>{{out}}

</syntaxhighlight>{{out}}

<pre>

0+5 1+3 2 2+3 1

Line 202:

</pre>

===Extra credit task ===

<~~lang~~ julia>""" From https://en.wikipedia.org/wiki/Domino_tiling#Counting_tilings_of_regions

<syntaxhighlight lang="julia">""" From https://en.wikipedia.org/wiki/Domino_tiling#Counting_tilings_of_regions

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

Line 228:

println("Possible flip configurations: $flips")

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

</~~lang~~>{{out}}

</syntaxhighlight>{{out}}

<pre>

Arrangements ignoring values: 1292697

Line 238:

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

<~~lang~~ ~~Mathematica~~>ClearAll[VisualizeState]

<syntaxhighlight lang="mathematica">ClearAll[VisualizeState]

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

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

Line 289:

sols = FindSolutions[tab];

Length[sols]

VisualizeState[sols[[1]], tab]</~~lang~~>

VisualizeState[sols[[1]], tab]</syntaxhighlight>

<pre>1

Line 297:

===Extra credit task ===

<~~lang~~ ~~Mathematica~~>ClearAll[DominoTilingCount]

<syntaxhighlight lang="mathematica">ClearAll[DominoTilingCount]

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

Round[Product[

Line 312:

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

Print["Possible flip configurations: ", flips]

Print["Possible permuted arrangements with flips: ", flips*arrangements*permutations]</~~lang~~>

Print["Possible permuted arrangements with flips: ", flips*arrangements*permutations]</syntaxhighlight>

<pre>Arrangements ignoring values: 1292697

Line 321:

=={{header|Perl}}==

<~~lang~~ perl>#!/usr/bin/perl

<syntaxhighlight lang="perl">#!/usr/bin/perl

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

Line 385:

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

}

}</~~lang~~>

}</syntaxhighlight>

<pre>

Line 423:

=={{header|Phix}}==

with javascript_semantics

Line 579:

test(unpack("05132231 05505246 43036620 06235126 11300245 21433466 64515414"))

test(rand_grid())

<pre>

Line 638:

===Extra credit===

Pretty dumb brute force approach, dreadfully slow.

without js -- too slow

enum IGNORE, CONSIDER, NOSYM

Line 688:

printf(1,"Arrangements ignoring symmetry: %g\n",count(NOSYM))

?elapsed(time()-t0)

<pre>

Line 697:

=== Much faster ===

with javascript_semantics

include mpfr.e

Line 727:

printf(1,"Possible permuted arrangements with flips: %s\n", mpz_get_str(perms,10,true))

printf(1,"Took %s\n",elapsed(time()-start))

<pre>

Line 741:

===Basic task===

<~~lang~~ ecmascript>var tableau = [

<syntaxhighlight lang="ecmascript">var tableau = [

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

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

Line 877:

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

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

}</~~lang~~>

}</syntaxhighlight>

Line 918:

<~~lang~~ ecmascript>import "./big" for BigInt

<syntaxhighlight lang="ecmascript">import "./big" for BigInt

import "./fmt" for Fmt

Line 943:

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

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

System.print("\nTook %(System.clock - start) seconds.")</~~lang~~>

System.print("\nTook %(System.clock - start) seconds.")</syntaxhighlight>

Line 958:

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.

<~~lang~~ ecmascript>import "./gmp" for Mpz, Mpf

<syntaxhighlight lang="ecmascript">import "./gmp" for Mpz, Mpf

import "./fmt" for Fmt

Line 984:

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

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

System.print("\nTook %(System.clock - start) seconds.")</~~lang~~>

System.print("\nTook %(System.clock - start) seconds.")</syntaxhighlight>