journal article
Open Access
Sep 01, 2013
Exhaustive generation of gominoes
Topics
No keywords indexed for this article. Browse by subject →
References
25
[1]
Golomb "Checker boards and polyominoes" American Mathematical Monthly (1954) 10.2307/2307321
[2]
Beauquier "On translating one polyomino to tile the plane" Discrete & Computational Geometry (1991) 10.1007/bf02574705
[3]
Golomb (1996)
[4]
Gardner "Mathematical games" Scientific American (1958) 10.1038/scientificamerican1258-126
[5]
Jensen "Enumerations of lattice animals and trees" Journal of Statistical Mechanics (2001)
[6]
N.J.A. Sloane, The On-Line Encyclopedia of Integer Sequences, Number of fixed polyominoes with n cells, 2005. http://oeis.org/A001168.
[7]
Jensen "Statistics of lattice animals (polyominoes) and polygons" Journal of Physics (2000)
[8]
D.A. Klarner, R.L. Rivest, A procedure for improving the upper bound for the number of n-ominoes, Technical Report, Stanford, CA, USA, 1972.
[9]
Pólya "On the number of certain lattice polygons" Journal of Combinatorial Theory (1969) 10.1016/s0021-9800(69)80113-4
[10]
Stanley (1999)
[11]
N.J.A. Sloane, The on-line encyclopedia of integer sequences, 2011. Published electronically at http://www.research.att.com/?njas/sequences.
[12]
Viennot "A survey of polyomino enumeration" (1992)
[13]
Bousquet-Mélou "Codage des polyominos convexes et équations pour l’énumération suivant l’aire" Discrete Applied Mathematics (1994) 10.1016/0166-218x(92)00103-s
[14]
Bousquet-Mélou "A method for the enumeration of various classes of column-convex polygons" Discrete Mathematics (1996) 10.1016/0012-365x(95)00003-f
[15]
Bousquet-Mélou "New enumerative results on two-dimensional directed animals" Discrete Mathematics (1998) 10.1016/s0012-365x(97)00109-x
[16]
Brlek "Tilings by translation: enumeration by a rational language approach" Electronic Journal of Combinatorics (2006) 10.37236/1041
[17]
Goupil "Enumeration of polyominoes inscribed in a rectangle" Discrete Applied Mathematics (2010) 10.1016/j.dam.2010.08.011
[18]
Redelmeier "Counting polyominoes: yet another attack" Discrete Mathematics (1981) 10.1016/0012-365x(81)90237-5
[19]
Bousquet-Mélou "The site perimeter of bargraphs" Advances in Applied Mathematics (2003) 10.1016/s0196-8858(02)00553-5
[20]
Sieben "Polyominoes with minimum site-perimeter and full set achievement games" European Journal of Combinatorics (2008) 10.1016/j.ejc.2006.12.008
[21]
Go (game)—wikipedia, the free encyclopedia, 2011.
[22]
W. Stein, et al., Sage Mathematics Software (Version 4.6.2), The Sage Development Team, 2011. http://www.sagemath.org.
[23]
Louwrentius, ∣P∣P∣S∣S∣-(Distributed) Parallel Processing Shell Script, 2011. http://code.google.com/p/ppss.
[24]
Egge "132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers" Discrete Applied Mathematics (2004) 10.1016/j.dam.2003.12.007
[25]
H. Cloutier, Énumération de polyominos à deux et à trois dimensions, Master’s thesis, Université du Québec à Trois-Rivières, Trois-Rivières, 2010.
Metrics
1
Citations
25
References
Details
- Published
- Sep 01, 2013
- Vol/Issue
- 502
- Pages
- 76-87
- License
- View
Cite This Article
Jérôme Fortier, Alain Goupil, Jonathan Lortie, et al. (2013). Exhaustive generation of gominoes. Theoretical Computer Science, 502, 76-87. https://doi.org/10.1016/j.tcs.2012.02.032
Related
You May Also Like
Quantum cryptography: Public key distribution and coin tossing
CHARLES H. BENNETT, Gilles Brassard · 2014
2,450 citations