Maksimālās pentamino arkas
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbā pētīta diskrētās optimizācijas problēma par pentamino arku maksimālajiem laukumiem L(h) atkarībā no arkas augstuma h. Problēmas risināšanai izstrādāts algoritms, kas balstās uz dinamiskās programmēšanas principu.
Atslēgvārdi: pentamino, pentamino arka, polimino, optimizācija.
The discrete optimization problem of the maximum area L(h) of the pentomino bridges depending on the height h of the bridge has been investigated in this work. The algorithm based on the principle of the dynamic programming has been elaborated for the problem solution. Keywords: pentomino, polyomino, bridge of pentominoes, optimization.
The discrete optimization problem of the maximum area L(h) of the pentomino bridges depending on the height h of the bridge has been investigated in this work. The algorithm based on the principle of the dynamic programming has been elaborated for the problem solution. Keywords: pentomino, polyomino, bridge of pentominoes, optimization.