Callahan, Jason; Mota, Maria Solving scramble squares puzzles with repetitions. (English) Zbl 1402.05203 Involve 12, No. 2, 343-349 (2019). Summary: A Scramble Squares puzzle consists of nine square pieces with half of an image on each side. To solve the puzzle the pieces are arranged in a \(3 \times 3\) grid so that sides of adjacent pieces form complete images. A repetition is a half-image that appears more than once on a piece. Previous research uses a graph-theoretical approach to establish necessary and sufficient conditions for solutions without repetitions to \(2 \times 2\) Scramble Squares puzzles. We use a similar approach to establish necessary and sufficient conditions for solutions with repetitions to \(2 \times 2\) Scramble Squares puzzles. MSC: 05C90 Applications of graph theory 91A99 Game theory Keywords:graph theory; directed graphs PDF BibTeX XML Cite \textit{J. Callahan} and \textit{M. Mota}, Involve 12, No. 2, 343--349 (2019; Zbl 1402.05203) Full Text: DOI OpenURL References: [1] ; de Carteblanche, Eureka, 9, 9 (1947) [2] 10.2307/2688218 · Zbl 0217.02203 [3] 10.2140/involve.2012.5.313 · Zbl 1264.05136 [4] 10.1007/BFb0060130 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.