Click here to Skip to main content
15,883,531 members
Please Sign up or sign in to vote.
1.00/5 (3 votes)
See more:
Design a track through the lands so that you cross each of the seven connections labeled, only once. All connections have to be completely traversed exactly once. The track must be uni-directional, i.e. you cannot double-back and move the way you came.(see appendix 3)

http://2012.lumspsifi.org/wp-content/uploads/2011/11/appendix-3.png
Posted
Updated 17-Nov-11 1:22am
v2
Comments
Smithers-Jones 17-Nov-11 7:21am    
Done. Now wasn't that fun? I hope you will have as much fun as I had.
phil.o 17-Nov-11 7:23am    
Sorry, we're not here for making other's homework.
Think about your problem, begin to design an algorithm, and come back here if you have a specific question.
If you're going to work as a developper, you'd better learn to think by yourself rather than relying on other's abilities.
Reiss 17-Nov-11 7:24am    
We don't do homework - it is set for a reason, there is also a reasonable chance that your tutor is a member of this site too!

1 solution

 
Share this answer
 
Comments
Reiss 17-Nov-11 9:16am    
That takes me back - statistical mechanics was the pet subject of one of my lecturers at uni

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900