This project represents Riipen's "Gold Mine" programmging problem.

Click here to see the Github repository.

Exercise

Given a gold mine of n * m dimensions, design an algorithm for a gold miner to collect as much gold as possible. Each field in this mine contains a positive integer which is the amount of gold in that space. The miner starts at the first column but can be at any row. The miner can only move right, diagonally right and up, or diagonally right and down.

GoldMine Diagram

If the miner leaves the mine for any reason (goes outside the dimensions of the mine), gold collection will cease and the final score will be the current score.

If the miner lands on a section of the mine that has zero gold (an integer value of 0), gold collection will cease and the final score will be the current score.

Rules

- Use your best discretion with the design of your solution

- You can ask questions

- You are free to add packages, tools, or improvements as you see fit

- We expect you write the kind of feature you would put into production, including tests and documentation as you see fit

Submission

Please submit a ZIP file which contains your solution.

Architecture

The current naive approach to mining can be found in `src/move.js`. Your job will be to improve upon the existing implementation in order to collect as much gold as possible.

If you wish to start your miner at a particular row of a given mine, you can change the `config.js` file to fit your needs.

Contact

We encourage you to use your best discretion, but also to ask questions and communicate if you need it.