It's been a looong time since I last visited this forum. (I forgot the username/password for my old account.) But now I'm capable of making my own puzzles (I hope)!
Find the minimum number of straight lines needed to cut a greek cross (example above) into pieces that can be re-assembled to make:
- One square
- Two congruent squares
- Three congruent squares (I don't actually know the answer--or if it's even feasible--but maybe you'll surprise me!)
- Four congruent squares
- Five congruent squares (It's not quite as obvious as it looks!)
- Four congruent greek crosses (I have a solution, but it's probably not optimal)
- Five congruent greek crosses (Same as #6)
I'm fairly confident that I have the optimal solutions for 1, 2, 4, and 5. I just threw in the others for an extra challenge.
Edited by ParaLogic, 18 March 2013 - 03:13 AM.