https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-X%3Asgha014 2026-04-29T02:24:27Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE250:lab-X:sgha014&diff=9134&oldid=prev 2008-11-03T05:20:48Z

<p>12 revision(s)</p> <p><b>New page</b></p><div>used rajitha&#039;s instructions to compile it with cygwin<br /> <br /> ==task 1==<br /> since theres 8 numbers in the puzzle, there are 8 possible states??<br /> <br /> no no no thats not right....ok there are 9 squares so the number of states is 9! (9 factorial)<br /> <br /> estimating the number of edges....<br /> ok so wen the space is at the bottom, u hav 2 options of where to go.<br /> if u decide to go up, u then hav 3 options, and if u go to the left instead of going up, u also have 3 places to go.<br /> if u end up in the middle u have 4 options.<br /> ok so there are 4 corners...each with 2 differnt options...so thats 8<br /> and 4 sides that each hav 3....so thats 12<br /> and 1 middle place with 4 options...<br /> so 8+12+4=24<br /> <br /> is it 24?? seems waaay too small<br /> <br /> so the tutor didnt knw how 2 do it so i asked a aguy in the lab...and managed to get this:<br /> 24/9 =2.67<br /> then there 9! states....so 9!*2.67 = 968889.2<br /> then diviede by 2 coz we counted each thing twice<br /> =&gt; 484444.8 edges<br /> <br /> ==task2==<br /> so iv bn on this task for aaaaages...trying to see wat the search thing does....makes no sense to me...its using lots of functions so im trying to look throuhg all teh files to see if i can find out wat each does....<br /> <br /> ==task3==<br /> my first attemt was relly stupid...luckily the tutor pointed it out for me before i got too far ahead.<br /> so then i drew it9properly this time)...then used graph.c to check it and it was right woho :D<br /> <br /> ==task4==</div>

Mark