TransWikia.com

Minimal 2D pattern for domino tiles where each tile touches three others

Puzzling Asked on March 1, 2021

Inspired by The five problems of the six domino tiles, where one of the tasks was to place six domino tiles so that each tile touches three others (corner / edge touches don’t count). My solution there required putting domino tiles on top of each other, and the OP (not the author of the puzzle) thought there is no 2D solution.

Now, if we increase the number of tiles, we can certainly make a 2D solution, e.g. the following one using 16 tiles:

enter image description here

A natural question/puzzle is therefore to ask:

What pattern uses the minimum number of tiles?

Rules:

  • The tiles are twice as long as wide
  • Tiles have to be laid out in a two-dimensional pattern
  • Each tile needs to touch exactly three others; only touches between edges count
  • Just to be pedantic: there needs to be at least one tile

One Answer

Based on your 16-tile example I reduced it down to

Sketch of proof why this is minimal:

Correct answer by Jaap Scherphuis on March 1, 2021

Add your own answers!

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP