Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
Number of Three-point Tilings with Triangle Tiles
Yasuhiko TakenagaNarutoshi TanakaTakahiro Habara
Author information
JOURNAL FREE ACCESS

2015 Volume 23 Issue 3 Pages 305-309

Details
Abstract

Three-point tiling is the problem to cover all the lattice points in a triangular region of the triangular lattice with triangle tiles that connect three adjacent lattice points. All the lattice points must be used by exactly one triangle tile. In this paper, we enumerate all the solutions and rotation symmetric solutions using ordered binary decision diagrams. In addition, the number of essentially different solutions, any two of which do not become identical by rotating and turning over, is computed.

Information related to the author
© 2015 by the Information Processing Society of Japan
Previous article Next article
feedback
Top