I'm sorry, but sliding puzzles don't require one be particularly gifted mentally or physically. Any given sliding puzzle regardless of size can be solved using the same rules assuming you know what the final location of each tile should be.
Start by solving the top most row, moving each tile into its final position (the final tile on any row is the most tricky to get into place without disrupting the rest, but you only need to figure out how to do it once and keep doing that). Repeat the process with the next row down without touching any completed portions until you have two rows remaining.
Once you have 2 rows left, work on solving the leftmost columns of the remaining 2 unsolved rows without changing any of your completed portions (note: starting with the rightmost column works as well, but most online guides seem to start from the left). Repeat this for the next column to the right until you have a 2 by 3 section of tiles left to solve.
As you have had sufficient room to move the tiles into their final positions without moving any completed tiles up until this point, this is the only point at which there is any actual puzzle to be solved. You want the tiles to end up like this (numerically labeled based on their final positions):
1.2.3
4.5.6
So you want to try and get the tiles in an order that, through rotation, will result in that final position. Any of the following positions will work:
2.3.6
1.4.5
3.6.5
2.1.4
6.5.4
3.2.1
5.4.1
6.3.2
4.1.2
5.6.3
Given the limited number of tiles remaining (and the fact that only moving tiles up or down from the middle of the 2 by 3 unsolved section causes a change in their rotational order), brute forcing the puzzle should allow you to achieve at least one of those configurations in relatively short order. The difficulty is just in recognizing one when you get it. Once you have one of these configurations, you need only rotate the whole 2 by 3 section into the solved positions.
25-Apr-2021 18:06:22
- Last edited on
25-Apr-2021 18:21:37
by
Hguoh
