A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a finite <i>target region</i> of the plane are well-known and typically applied on a case-by-case basis. In this article, we give a systematic mathematical treatment of such colouring arguments, based on...
Shranjeno v:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
MDPI AG
2022-02-01
|
| Serija: | Algorithms |
| Teme: | |
| Online dostop: | https://www.mdpi.com/1999-4893/15/2/65 |
| Oznake: |
Brez oznak, prvi označite!
|