https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-X%3Asbas046
SE250:lab-X:sbas046 - Revision history
2026-04-30T17:22:40Z
Revision history for this page on the wiki
MediaWiki 1.45.3
https://wiki.kram.nz/index.php?title=SE250:lab-X:sbas046&diff=9108&oldid=prev
Mark: 11 revision(s)
2008-11-03T05:20:48Z
<p>11 revision(s)</p>
<p><b>New page</b></p><div>== Task 1 ==<br />
Number of states: <br />
calculated by 9 factorial (9P9)<br />
<pre>362880</pre><br />
<br />
Number of edges:<br />
the number of state transitions are 9!/2(going back to the same state) and the average number of legal moves from each state is 24/9.<br />
Hence the number of states edges are (9!*24)/18<br />
<pre>483480</pre><br />
<br />
== Task 2 ==<br />
* while the state is not empty:<br />
* looks at the adjacent states. (pops off the ordered state list)<br />
* if the state is the final state then break the program.<br />
* else add the state to the ordered state list<br />
* repeat<br />
<br />
== Task 3 ==<br />
<html><a><img src="http://img27.picoodle.com/img/img27/4/6/2/f_graphm_08036dd.jpg" border="0" alt="Graph" /></a></html><br />
<br />
== Task 4 ==<br />
Here are the last few searches the program performs before finding the final state.<br />
It is depth first search. It looks at its children's children until it all the children are either empty or they have already been visited. <br />
<pre>126<br />
5.4<br />
783<br />
<br />
126<br />
54.<br />
783<br />
<br />
126<br />
543<br />
78.<br />
<br />
12.<br />
546<br />
783<br />
<br />
126<br />
584<br />
7.3<br />
<br />
126<br />
584<br />
73.<br />
<br />
.26<br />
154<br />
783<br />
<br />
2.6<br />
154<br />
783<br />
<br />
26.<br />
154<br />
783<br />
<br />
264<br />
15.<br />
783<br />
<br />
264<br />
153<br />
78.<br />
<br />
264<br />
153<br />
7.8<br />
<br />
142<br />
6.5<br />
738<br />
<br />
142<br />
65.<br />
738<br />
<br />
142<br />
658<br />
73.<br />
<br />
142<br />
658<br />
7.3<br />
<br />
142<br />
.65<br />
738<br />
<br />
142<br />
765<br />
.38<br />
<br />
142<br />
765<br />
3.8<br />
<br />
142<br />
765<br />
38.<br />
<br />
$<br />
76.<br />
385<br />
<br />
142<br />
7.6<br />
385<br />
<br />
1.2<br />
746<br />
385<br />
<br />
12.<br />
746<br />
385<br />
<br />
126<br />
74.<br />
385<br />
<br />
126<br />
745<br />
38.<br />
<br />
126<br />
745<br />
3.8<br />
<br />
126<br />
745<br />
.38<br />
<br />
126<br />
.45<br />
738<br />
<br />
126<br />
4.5<br />
738<br />
<br />
126<br />
45.<br />
738<br />
<br />
12.<br />
456<br />
738<br />
<br />
1.2<br />
456<br />
738<br />
<br />
152<br />
4.6<br />
738<br />
<br />
152<br />
436<br />
7.8<br />
<br />
152<br />
436<br />
78.<br />
<br />
152<br />
43.<br />
786<br />
<br />
152<br />
4.3<br />
786<br />
<br />
1.2<br />
453<br />
786<br />
<br />
12.<br />
453<br />
786<br />
<br />
123<br />
45.<br />
786</pre><br />
<br />
== Task 5 ==<br />
The search.exe file lists the shortest path from the initial state to the final state whereas the graph details every state and edge.<br />
<br />
== Task 6 ==<br />
<br />
== Task 7 ==<br />
<br />
== Task 8 ==<br />
<br />
== Task 9 ==<br />
<br />
== Task 10 ==</div>
Mark