Dominoes: Difference between revisions
m
correct formula
m (different source for formula) |
m (correct formula) |
||
Line 202:
</pre>
===Extra credit task ===
<lang julia>""" From https://
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 208:
function dominotilingcount(m, n)
return BigInt(floor(prod([prod(
[
for k in 1:(n+1)÷2]) for j in 1:(m+1)÷2]
)))
end
Line 222:
println("Possible flip configurations: $flips")
println("Possible permuted arrangements with flips: ", flips * arrang * perms)
<pre>
Arrangements ignoring values:
Permutations of 28 dominos: 304888344611713860501504000000
Permuted arrangements ignoring flipping dominos:
Possible flip configurations: 268435456
Possible permuted arrangements with flips:
</pre>
| |||