PLEASE NOTE: this server, secure.csse.uwa.edu.au, will be unavailable on Monday 5th December, from 1pm until 4pm.
Web-based programs, such as csmarks, cssubmit, and the help fora, will all be unavailable.
  It's UWAweek 49

help3001

This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 175 articles.
Currently 8 other people reading this forum.


 UWA week 33 (2nd semester, week 4) ↓
SVG not supported

Login to reply
4:26pm Tue 16th Aug, ANONYMOUS

3 1.0 1.0 1.0 2.0 2.0 1.0 is saying that there are 3 cities with located at the following x-y coordinates (1.0,1.0), (1.0,2.0), (2.0,1.0). The adjacency matrix of the distances between the cities can be calculated from these coordinates (part underlined in red in image). To get full marks (green tick) for the basic test, the cost of the route your algorithm comes up with needs to be less than 3.5.(part underlined in blue in image).



This article has 1 attachment:

 

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  1:17AM Sep 14 2022
Privacy policy