She had no problem solving questions like: Beginning and ending at the entrance, describe the shortest route you can take that will allow you to see 4 different kinds of animals.

"You're doing computer science," I said.

"I don't see any computers," she responded.

"Computer science is problem solving like finding the shortest path."

"Then computer science is pretty easy."

"OK, is there a way to visit every animal exactly once?"

She found this question much more challenging.

Do you mean "shortest path that visits each animal exactly

ReplyDeleteonce"? Otherwise it really isn't very hard...

You didn't specify if you could traverse the same path more than once.

ReplyDeleteTraversing this Zoo is very complex!

ReplyDeleteis the problem of shortest path using eucliadian distance is not polynomial? roads on the map you poiuned are almost straight so the problem must be close to euclidian

ReplyDelete