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...

Ausführliche Beschreibung

Bibliografische Detailangaben

Hauptverfasser:	Marcus R. Garvie, John Burkardt
Format:	Artigo
Sprache:	Inglês
Veröffentlicht:	MDPI AG 2022-02-01
Schriftenreihe:	Algorithms
Schlagworte:	tiling with polyominoes colouring arguments parity violation linear Diophantine equations MATLAB
Online-Zugang:	https://www.mdpi.com/1999-4893/15/2/65
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!