Oorang
Well-known Member
- Joined
- Mar 4, 2005
- Messages
- 2,071
8 is impossible and I'll prove it.
To make the conversation easier, let's number the tiles:
<table border="1"><tbody><tr><td bgcolor="cyan">1</td><td bgcolor="#33ff33">2</td><td bgcolor="cyan">3</td></tr><tr><td bgcolor="#33ff33">4</td><td bgcolor="red">5</td><td bgcolor="#33ff33">6</td></tr><tr><td bgcolor="#3333ff">7</td><td bgcolor="#33ff33">8</td><td bgcolor="#3333ff">9</td></tr></tbody></table>
Of course what this doesn't prove is that 16 is optimum I'll give you hint though... 5 is red for a reason
To make the conversation easier, let's number the tiles:
<table border="1"><tbody><tr><td bgcolor="cyan">1</td><td bgcolor="#33ff33">2</td><td bgcolor="cyan">3</td></tr><tr><td bgcolor="#33ff33">4</td><td bgcolor="red">5</td><td bgcolor="#33ff33">6</td></tr><tr><td bgcolor="#3333ff">7</td><td bgcolor="#33ff33">8</td><td bgcolor="#3333ff">9</td></tr></tbody></table>
- To solve this in 8 moves each piece would have to only move twice. All possible combinations of 0 or 1 moves from the starting position would leave any piece in an illegal finishing position.
As there are 4 pieces any more than 2 more than two moves would cause you to run out moves before all pieces are in the proper finishing position, thus each piece must move twice. - From each start position there are only two legal moves: 1 vertical, 2 horizontal; or 2 vertical and 1 horizontal (the green tiles).
- Of those 2 legal moves, for all starting positions, only 1 move puts you in a position to move to a "Finishing Tile" in the next move. That move is 1 vertical, 2 horizontal.
- So for a successful 8 move solution the first moves must be either: 1 to 6; 3 to 4; 7 to 6; or 9 to 4. There are no other options.
- From any green square each piece will now have only 1 move left, and only one square that will take them to a legal finishing position. This means each piece only has one possible finishing position for an 8 square victory.
- Now notice that 3 and 9 both both share the same one and only legal move (as do 1 and 7). Therefore if 3 takes it's one and only legal move. Then 9 has no possible legal first move and vice versa (the same for 1 & 7).
- In an 8 move scenario, every piece has only 1 legal move, and that legal move makes illegal another piece's only legal move. QED an 8 move solution is impossible.
Of course what this doesn't prove is that 16 is optimum I'll give you hint though... 5 is red for a reason
Last edited: