Open Access

Rules for folding polyminoes from one level to two levels


Cite

[1] Brzustowski, J. "Can you win at Tetris?", Master's thesis, The University of British Columbia, Canada, March 1992.Search in Google Scholar

[2] Burgiel, H. "How to Lose at Tetris", The Mathematical Gazette, 81(491), 194-200, July 1997.10.2307/3619195Search in Google Scholar

[3] Frederickson, G. N. Dissections: Plane & Fancy. Cambridge University Press, 1997.10.1017/CBO9780511574917Search in Google Scholar

[4] Frederickson, G. N. "Folding Polyominoes from One Level to Two", The College Math Journal, 42(4), 265-274, September 2011.10.4169/college.math.j.42.4.265Search in Google Scholar

[5] Golomb, S. W. Polyominoes: Puzzles, Patterns, Problems, and Packings, Princeton University Press, 1994.10.1515/9780691215051Search in Google Scholar

[6] Martin, G. E. Polyominoes: A guide to puzzles and problems in tiling, The Mathematical Association of America, 1987.Search in Google Scholar

eISSN:
2182-1976
Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Mathematics, General Mathematics