https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-X%3Aapra102SE250:lab-X:apra102 - Revision history2026-06-17T18:33:03ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-X:apra102&diff=8856&oldid=prevMark: 11 revision(s)2008-11-03T05:20:43Z<p>11 revision(s)</p>
<p><b>New page</b></p><div>==Task 1==<br />
ok as there are 9 blocks in the given puzzle there are 9! different states exists.<br />
9*8*7*6*5*4*3*2*1 = 362880. Therefore there are 362880 possible different states.<br />
In the next part: should calculate number of edges in the complete state space graph. By looking at the puzzle i figured out that if the blank is at the 4 edges of the puzzle then it has 2 possible moves,if it is in the middle of the line then it has 3 possible moves,<br />
if it is in the middle of the whole puzzle then it has 4 possible moves. Hence the total moves it can move is (4*2)+(4*3)+(1*4) = 24.<br />
If there are 362880 possible ways for 9edges,then how many possible ways there will be for 24 edges?<br />
=> (362880*24)/9 = 967680. yay finally sorted out the task 1.<br />
<br />
==Task 2==<br />
I looked at the code twice but still lost will have a look at it later. Skipping to task 3.<br />
<br />
==Task 3==<br />
<html><br />
<img src="http://studwww.cs.auckland.ac.nz/~apra102/lab10/graph.html.jpg" width="450" height="500" alt="task3" /><br />
</html></div>Mark