Algorithm help: Which algorithm to use?

[Jggrnt]

I am coding a program which finds the cheapest way to carry a product.

We have a building which is N * N * N sized.

We have a start room and finish room.

Some of the rooms are restricted. We are not allowed to enter these rooms.

We have limited move options with different costs:

-go east: cost 1

-go west: cost 1

-go north: cost 1

-go south: cost 1

-go up: cost 1

-turn a floor 90 degrees in CC or CCC: cost (number of floors above the floor) + 1


Thanks for helping me. Looking forward to see your answers.

[soranz]

The algorithm is for u to figure out first. Ask for help along the way...

[Anomen]

Hi,

Google Dijkstra's algorithm that may help.

Good luck