Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    text
    copied!<p>I've studied this same problem/puzzle when I was in college and its a very interesting problem that involves AI and heuristic techniques and graph-theory. As stated by <strong>amit</strong>, you is strongly recommended to check A*, BFS and heuristics.</p> <p>Here is my contribution: when trying to solve this, you can try a <strong>divide to conquer</strong> strategy. You can think that this 6x6 grid is just four 3x3 grids coupled close each other, and try to solve each one as separated cases in a given order.</p> <p>For instance, you can try the following algorithm:</p> <ol> <li>arrange your pieces in a manner that the left-upper grid contains all of its pieces, except one (that will be used as working space);</li> <li>solve the left-upper grid;</li> <li>arrange the right-upper grid in a manner that it contais all of its pieces, except the botttom-right one (that will be used as working space);</li> <li>solve the right-upper grid;</li> <li>... and so on, independetly of the number of grids!</li> </ol> <p>The final issue to say is that you must <strong>pay attention on which corner you gonna left as working space</strong> as you can't let the upper-right corner of the upper-right grid be your working space "missing pieces" because it will be not possible to put a piece there in future;</p> <p>Ps1: working space is the position that you temporary let the piece missed, to be able to have a free space to maneuver pieces;</p> <p>Ps2: in this context, grid is a combination of NxN pieces, that haves all the correct pieces, not necessarily in order.</p> <p>Hope that I've helped in some way. :-)</p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload