Search

One wants to get from one particular street address in Chicago, Illinois to

another particular street address in New York City, New York, by car.

There are $2$ highways between the two $($I$-80$ and a more complicated one

involving I$-76)$ but a computer may not know this. It would have to find

them.

There are several major roads that are not highways that go between them

$($again$,$ assume a computer would have to find them$).$

There are many, many interconnecting small roads between them $($again$,$

assume a computer would have to find them$).$

Recommend an approach for finding a route that is:

computationally efficient $($easier for the computer to find$)$

relatively fast for someone to drive

Your recommendation should consider:

which search algorithm to use

what data the algorithm will use $($if any$)$

which scale$($s$)$ should be used to solve the problem

other additional knowledge that you think is relavent