Free polyominoes enumeration: Difference between revisions

{{trans|D}}

Turns out the source for the counting only version of the D code example could be tweaked to show solutions as well. The max rank can be changed by supplying a command line parameter. The free polyominos of any rank can be displayed by changing the variable named '''target''' to a reasonable number. This program will also indicate the estimated times for larger ranks.

using System.Collections.Generic;

using System.Linq;

}

}

{{out}}

<pre>Counting polyominoes to rank 11...

=={{header|D}}==

{{trans|Haskell}}

 

alias Coord = byte;

foreach (const poly; n.rank)

writefln("%-(%s\n%)\n", poly.textRepresentation);

{{out}}

<pre>[1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655]

Translated and modified from C code: http://www.geocities.jp/tok12345/countomino.txt

 

import core.stdc.stdlib: atoi;

 

 

return 0;

{{out}}

<pre>1

=={{header|Elixir}}==

{{trans|Ruby}}

defp translate2origin(poly) do

# Finds the min x and y coordiate of a Polyomino.

IO.puts "\nAll free polyominoes of rank #{n}:"

Enum.sort(Polyominoes.rank(n))

 

{{out}}

=={{header|Go}}==

{{trans|Kotlin}}

 

import (

}

fmt.Println()

 

{{out}}

 

Code updated and slightly improved from: http://www.haskell.org/haskellwiki/The_Monad.Reader/Issue5/Generating_Polyominoes

import Control.Arrow ((***), first)

import Data.Set (toList, fromList)

let n = bool (read $ head args :: Int) 5 (null args)

putStrLn ("\nAll free polyominoes of rank " ++ show n ++ ":")

{{out}}

<pre>[1,1,2,5,12,35,108,369,1285,4655]

Generating polyominoes as ascii art:

 

if. 1>y do. i.0 0 0 return.end.

if. 1=y do. 1 1 1$'#' return.end.

trim=:verb define&|:^:2

y#~+./"1 y~:' '

 

Example use (boxing each pentomino for display purposes):

 

┌─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┐

│#####│## │# │### │## │## │### │ ## │ # │ # │ # │ ## │

│ │# │# │# │# │## │ │## │## │### │ # │# │

│ │# │# │ │ │ │ │ │ │ │ │ │

 

=={{header|Java}}==

Translation of [[Free_polyominoes_enumeration#Haskell|Haskell]] via [[Free_polyominoes_enumeration#D|D]]

{{works with|Java|8}}

import java.util.*;

import static java.util.Arrays.asList;

}

}

 

<pre>(0,0) (0,1) (1,1) (1,2) (2,1)

(0,0) (0,1) (0,2) (1,0) (2,0)

(0,0) (0,1) (0,2) (0,3) (0,4)</pre>

 

=={{header|Julia}}==

{{trans|Haskell}}

 

struct Point x::Float64; y::Float64 end

 

testpolys()

<pre>

[1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655]

=={{header|Kotlin}}==

{{trans|Python}}

 

class Point(val x: Int, val y: Int) : Comparable<Point> {

for (i in 1..k) print("${rank(i).size} ")

println()

 

{{out}}

=={{header|Nim}}==

{{trans|Kotlin}}

 

type Point = tuple[x, y: int]

echo "\nNumber of free polyominoes of ranks 1 to $#:".format(k)

for i in 1..k: stdout.write rank(i).len, ' '

 

{{out}}

=={{header|Perl}}==

Only shows the polyominoes up to rank 5.

 

use strict;

}

keys %new;

{{out}}

<pre>

=={{header|Phix}}==

Written for clarity over raw speed.

<span style="color: #000080;font-style:italic;">-- demo\rosetta\Polyominoes.exw</span>

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

<span style="color: #008080;">if</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">></span><span style="color: #000000;">0</span> <span style="color: #008080;">and</span> <span style="color: #000000;">i</span><span style="color: #0000FF;"><=</span><span style="color: #000000;">5</span> <span style="color: #008080;">then</span> <span style="color: #000000;">print_polys</span><span style="color: #0000FF;">(</span><span style="color: #000000;">ri</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

=={{header|Python}}==

{{trans|Haskell}}

from operator import itemgetter

from sys import argv

print text_representation(poly), "\n"

 

{{out}}

<pre>[1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655]

not included in code below). But I think it's interesting nonetheless.

 

;; Inspired by C code in http://www.geocities.jp/tok12345/countomino.txt

;; but tries to take advantage of arbitrary width integers

(when (< n 6) (draw-polynominoes p))

(printf "count: ~a~%~%" (length (polynominoes-shapes p)))

 

{{out}}

=={{header|Ruby}}==

{{trans|Python}}

 

def translate2origin(poly)

n = ARGV[0] ? ARGV[0].to_i : 5

puts "\nAll free polyominoes of rank %d:" % n

 

{{out}}

Translation of [[Free_polyominoes_enumeration#Haskell|Haskell]] via [[Free_polyominoes_enumeration#D|Java]]

{{works with|Scala|2.12}}

type Point = (Int, Int)

type Polyomino = List[Point]

}

}

 

<pre>(0,0) (0,1) (1,1) (1,2) (2,1)

=={{header|Sidef}}==

{{trans|Ruby}}

# Finds the min x and y coordiate of a Polyomino.

var minx = poly.map(:head).min

var n = (ARGV[0] ? ARGV[0].to_i : 5)

say ("\nAll free polyominoes of rank %d:" % n)

{{out}}

<pre style="height:250px">

{{libheader|Wren-sort}}

{{libheader|Wren-seq}}

import "io" for Stdout

 

Stdout.flush()

}

 

{{out}}