• Corpus ID: 238583202

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

@article{Banbara2021SolvingRB,
  title={Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions},
  author={Mutsunori Banbara and Kenji Hashimoto and Takashi Horiyama and Shin-ichi Minato and Kakeru Nakamura and Masaaki Nishino and Masahiko Sakai and Ryuhei Uehara and Yushi Uno and Norihito Yasuda},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.05184}
}
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit squares edge to edge. These two notions were first introduced and investigated by Solomon W. Golomb in the 1950s and popularized by Martin Gardner in the 1960s. Since then, dozens of studies have been made in communities of recreational mathematics and puzzles. In this study, we first focus on the specific rep-tiles… 

References

SHOWING 1-5 OF 5 REFERENCES
Knuth . The Art of Computer Programming : Dancing Liniks , Volume 4 , pre - fascicle 5 c , September , 2019 . [ 6 ] Donald E . Knuth
  • Clarke . Polyomino Reptiles
The Art of Computer Programming: Dancing Liniks
    Knots and Borromean Rings
    • Rep-Tiles, and Eight Queens: Martin Gardner's Unexpected Hanging
    • 2014
    The Art of Computer Programming: Bitwise Tricks & Techniques; Binary Decision Diagrams
    • 2009
    Polyomino Reptiles