Hey guys,

First of all I'm seriously stuck on this assignment and literally have got no idea where to start so some much needed advice would be grateful helpful. Basically I'm stuck because I'm not entirely sure where to start. I have an algorithm to base my assignment off but I cant figure out how to replicate this in C, this algorithm is as follows:

we have a 12 x 12 maze to with sides of the mazes declared as taboo. help!Code:while (not at destination && non-taboo adjacent cell exists) Add current cell to visited list Add current cell's penalty to total penalty Mark current cell as taboo Check if destination found Find cheapest non-taboo adjacent cell Check if stuck Move to cheapest cell