Polimino salikumu skaita problēma
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Darbā ir atrisināta n-salikumu problēma vienkāršākajiem polimino: domino, trimino, tetramino, kā arī doti daži vispārinājumi.
The n-tilings problem for simplest polyominoes: domino, tromino, tetromino has been solved in this Bachelor thesis. Some generalizations have been given.
The n-tilings problem for simplest polyominoes: domino, tromino, tetromino has been solved in this Bachelor thesis. Some generalizations have been given.