GitHub - aroojishfaq/goldmine-game: This algorithm uses linear time complexity and breaks the bigger problem into smaller sub-problems and stores it after each calculation. The path that has the maximum amount of gold is selected and the miner will collect the gold on its way and following these restrictions along with some defined restricted moves (. right, right-down, right-up) the miner will try to collect highest cost gold. The miner will move towards the index where there is highest amount of gold. The game consists of ten levels. At each level the player must collect maximum amount of gold in order to proceed to the next level and is given three tries at each level.

aroojishfaq / goldmine-game Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This algorithm uses linear time complexity and breaks the bigger problem into smaller sub-problems and stores it after each calculation. The path that has the maximum amount of gold is selected and the miner will collect the gold on its way and following these restrictions along with some defined restricted moves (. right, right-down, right-up) …