https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-X%3Avpup001SE250:lab-X:vpup001 - Revision history2026-04-15T06:51:13ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-X:vpup001&diff=9202&oldid=prevMark: 14 revision(s)2008-11-03T05:20:49Z<p>14 revision(s)</p>
<p><b>New page</b></p><div>==task1==<br />
<br />
well there are 9 squares so apparently there will 9! states. <br />
<br />
To estimate the number of edges in the complete state space graph, we need to calculate the number of posible squares the "space" can go from every single square of 3x3 grid.<br />
<br />
I had no idea how to calculate it. I got help from this guy in the lab.<br />
*if the space is in the corners it has 2 posible choices and there are 4 corners.<br />
*if it is in the middle it has 4 choices.<br />
*if it is goes to left or up from the corner, it has 3 choices from that position and there are 4 square with 3 choices.<br />
(4*2)+(4)+(4*3)=24<br />
<br />
Then you divide that by 9 since there are 9 grids. 24/9=2.67 and since there 9! states, times the answer by 9! and since we have repeated the choice twice, we divide it by 2. <br />
<br />
So, the answer is... 9!*2.67/2=483840.<br />
<br />
There are 483840 edges in the complete stae space graph.<br />
<br />
==task 2==<br />
I am not sure what's going on here.<br />
<br />
==task 3==<br />
<br />
With the help of the tutor, I figured out how to draw the graph. I checked it with the file graph.c and it looks the same :)</div>Mark