Fill This Form To Receive Instant Help

Help in Homework
trustpilot ratings
google ratings


Homework answers / question archive / Programming Mini-Project 1 Uninformed & Informed Search; Game Playing Max possible score: ? 4308: 150 Points ? 5360: 150 Points Part 1 Max: [4308: 75 Points, 5360: 75 Points] Figure 1: Graphical representation of information in input1

Programming Mini-Project 1 Uninformed & Informed Search; Game Playing Max possible score: ? 4308: 150 Points ? 5360: 150 Points Part 1 Max: [4308: 75 Points, 5360: 75 Points] Figure 1: Graphical representation of information in input1

Computer Science

Programming Mini-Project 1
Uninformed & Informed Search; Game Playing
Max possible score:
? 4308: 150 Points
? 5360: 150 Points
Part 1
Max: [4308: 75 Points, 5360: 75 Points]
Figure 1: Graphical representation of information in input1.txt
Implement a search algorithm that can find a route between any two cities. Your program will be called find_route, and will take exactly commandline arguments
as follows:

find_route input_filename origin_city destination_city heuristic_filename

An example command line 1s:

find_route input].txt Bremen Kassel (For doing Uninformed search)

or

find_route input] .txt Bremen Kassel h_kassel.txt (For doing Informed search)

If heuristic is not provided then program must do uninformed search. Argument
input_filename is the name of a text file such as, that describes road connections
between cities in some part of the world. For example, the road system described
by file inputl.txt can be visualized in Figure | shown above. You can assume that
the input file is formatted in the same way as input.txt: each line contains three
items. The last line contains the items "END OF INPUT", and that is how the
program can detect that it has reached the end of the file. The other lines of the file
contain, in this order, a source city, a destination city, and the length in kilometers
of the road connecting directly those two cities. Each city name will be a single
word (for example, we will use New_York instead of New York), consisting of
upper and lowercase letters and possibly underscores.

IMPORTANT NOTE: MULTIPLE INPUT FILES WILL BE USED TO GRADE
THE ASSIGNMENT, FILE IS JUST AN EXAMPLE. YOUR CODE SHOULD
WORK WITH ANY INPUT FILE FORMATTED AS SPECIFIED ABOVE.

The program will compute a route between the origin city and the destination city,
and will print out both the length of the route and the list of all cities that lie on that
route. It should also display the number of nodes expanded and nodes generated.
For example,

find_route inputl .txt Bremen Kassel

should have the following output:

nodes expanded: 12

nodes generated: 20

distance: 297.0 km

route:

Bremen to Hannover, 132.0 km

Hannover to Kassel, 165.0 km
The assignments will be graded out of 75 points.

e 35 points: The program always finds a route between the origin and the
destination, as long as such a route exists.

e 15 points: The program terminates and reports that no route can be found
when indeed no route exists that connects source and destination (e.g., if
source 1s London and destination is Berlin, in the above example).

e 15 points: In addition to the above requirements, the program always returns
optimal routes. In other words, no shorter route exists than the one reported
by the program.

e 10 points: Correct implementation of any informed search method. Please
note that you only need to make one submission that meets this and all
previous requirements to get credit for all the parts.

e Negative points: penalty points will be awarded by the instructor and TA
generously and at will, for issues such as: submission not including precise
and accurate instructions for how to run the code, wrong compression
format for the submission, or other failures to comply with the instructions
given for this assignment. Partial credit for incorrect solutions will be given
ONLY for code that is well designed and well documented. Code that 1s
badly designed and badly documented can still get credit only as long as it
accomplishes the required tasks.

Purchase A New Answer

Custom new solution created by our subject matter experts

GET A QUOTE

Related Questions