https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-X%3Arthu009SE250:lab-X:rthu009 - Revision history2026-06-04T21:39:36ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-X:rthu009&diff=9075&oldid=prevMark: 3 revision(s)2008-11-03T05:20:47Z<p>3 revision(s)</p>
<p><b>New page</b></p><div>== Lab 10 ==<br />
<br />
<br />
== Task 1 ==<br />
<br />
The puzzle was a not 8 pice ie 9 pice including the space. So the number of states is 9! or 362880.<br />
The estimated number of edges i figured out with the following. This is because corners have 2 points then sides have 3 points and the middle has 4 points so therefore we have<br />
<br />
(9! * 2.6666 ) / 2 = 483840<br />
<br />
<br />
== Task2 ==<br />
<br />
The algorithm is a best first search. It adds the <br />
states to a tree which is sorted using the Manhattan distance. The next state to examine is the minimum node of the tree which will be the state with the smallest Manhattan distance.</div>Mark