Off topic:Find the shortest path
0
0
Entering edit mode
8.6 years ago
  1. Tom is chasing jerry in a maze. He needs to eat all Cheeses in the maze, then only then he will be able to reach Jerry. You have to find smallest path that TOM should take to eat all Cheeses and reach Jerry.

TOM can only run straight - left, right, top and down.

Input :

Tom Position (0,0)
Jerry Position (7,7)
Position of all Cheeses - (2,2), (1,5), (5,5), (6,1)
dynamic-programming algorithm • 814 views
ADD COMMENT
This thread is not open. No new answers may be added
Traffic: 1667 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6