For ease of programming you can consider the maze as a 2D
array with colors represented by below integer and
characters (in capital letters).
• B - Black
• W -White
• G- Green
• R- Red
R B W B W W W W
W W
B W B B W W W W
W W
W B W B W W W B
W W
W W B B W W W B
W W
W B W W B B B B
W B
W B W W B W W W
B W
W W B B B W W B
W W
W B W W B W B W
W W
B W B W W W W B
B W
W W W B W W W W
W G
Shortest Route Problem:
• Solution that finds the shortest Route between Red
and Green
 White will have 1 Weight.
 Red and Green carry no weights.
 Shortest path is the path with less weight when you
add up the weights in the path.
- 0 Answers
- 1587 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is the best way to findout the time/memory consuming process?
What is the difference between choice and list?
What is the difference between call by reference and call by pointer?
What is a java predicate?
How many types of equations are there?
Why does java not allow multiple public classes in a java file ?
which pattern is default in scanner package?
what is Hashmap & Hashtable wirh example?
What is an immutable object?
What is the GregorianCalendar class?
Does java have a compiler?
What are the advantages of user defined functions?
Core Java 
