Greedy Dwarf

function Solve(args) {
    var field = args[0].split(', ');

    for (var i = 0; i < field.length; i++) {
            field[i]=parseInt(field[i]);
        }

    var currentPattern=[];

    var maxCoins = -Number.MAX_VALUE;

    for (var i = 2; i < args.length; i++) {

        currentPattern=args[i].split(', ');

        for (var j = 0; j < currentPattern.length; j++) {
            currentPattern[j]=parseInt(currentPattern[j]);
        }

        var currentIndex=0;
        var visitedElements = {};
        var tempCoins = 0
        var patternIndex = 0;

        while (currentIndex>=0 && currentIndex<field.length && !visitedElements[currentIndex]){

            tempCoins+=field[currentIndex];
            visitedElements[currentIndex]=true;

            currentIndex+=currentPattern[patternIndex]

            patternIndex++;

            if (patternIndex==currentPattern.length) {
                patternIndex=0;
            }

        }
        if (tempCoins>maxCoins) {
            maxCoins=tempCoins;
        }
    }

    return maxCoins;
}