Ok guys this was a little difficult for me to figure out. So I would like someone to help me solve this puzzle.
Basically with have a square room (array) whose sides size are m = 2^n (where n any number). For example 2x2, 4x4, 16x16.
What we have to do is fill this room with Γ tiles (if we delete from a 2x2 square an 1x1 square).
I have to find an algorithm and prove that any square room can be filled with these Γ tiles leaving only one 1x1 square unfilled.
This algorithm has to work no matter where we decide this 1x1 square to be unfilled.
So lets say that this square will be on A(j,k) = t. Where A is the mxm array, j and k the coordinates of the unfilled 1x1 square and symbolise it with t.
So the user is going to set the place where this unfiled 1x1 square will be.
The other Γ tiles will be symbolised with 1,2,3,4...ect.
Sorry for my English.
The algorithm looks like can be made as rectroactive.
Thanks in Advance!!!
Edited by shadowstep00, 19 January 2014 - 11:04 AM.