Skip to main content
Log in

An algorithm and program of exhaustive search for possible tiling of a plane with polyominoes

  • Software
  • Published:
Crystallography Reports Aims and scope Submit manuscript

Abstract

Within the method of discrete modeling of packings in molecular crystals, an algorithm of the exhaustive search for all possible tiling variants of a plane with polyominoes with the given number of translationally independent cells has been developed on the basis of the packing code. The suggested algorithm was used to write the corresponding program for a personal computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. N. Delone, Izv. Akad. Nauk SSSR, Ser. Mat. 23, 365 (1959).

    MATH  MathSciNet  Google Scholar 

  2. B. N. Delone, N. P. Dolbilin, and M. I. Shtogrin, Tr. Mat. Inst. im. V. A. Steklova, Akad. Nauk SSSR 148, 109 (1978).

    MathSciNet  Google Scholar 

  3. A. V. Maleev, V. G. Rau, K. A. Potekhin, et al., Dokl. Akad. Nauk SSSR 315(6), 1382 (1990) [Sov. Phys. Dokl. 35, 997 (1990)].

    Google Scholar 

  4. A. V. Maleev, Kristallografiya 40(3), 394 (1995) [Crystallogr. Rep. 40, 354 (1995)].

    ADS  MATH  MathSciNet  Google Scholar 

  5. The Mathematical Gardner, Ed. by D. A. Klarner (Prindle, Weber and Schmidt, Boston, 1981; Mir, Moscow, 1983), p. 303.

    Google Scholar 

  6. A. V. Maleev, A. E. Lysov, and K. A. Potekhin, Kristallografiya 43(5), 775 (1998) [Crystallogr. Rep. 43, 721 (1998)].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Kristallografiya, Vol. 46, No. 1, 2001, pp. 165–167.

Original Russian Text Copyright © 2001 by Maleev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maleev, A.V. An algorithm and program of exhaustive search for possible tiling of a plane with polyominoes. Crystallogr. Rep. 46, 154–156 (2001). https://doi.org/10.1134/1.1343145

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/1.1343145

Keywords

Navigation