/*
MIT License

Copyright (c) [2017] [Golibrary.co]

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

@Author: Saurabh Gattani
Email:- saurabh.gattani@gmail.com
*/




/*  0 0 10
           

           
            3 0 7           0 7 3
           
    0 0 10      3 7 0   3 4 3   3 7 0
                            |
                            |
                            |
                        3 7 0     0 4 6
                                    |
                                    |
                                    |
                                3 1 6   0 7 3   0 0 10  3 4 3
                                    |
                                    |
                                    |
                            0 4 6   0 1 9
                                    |
                                    |
                                    |
                                    3 1 6  1 0 9  0 0 10
                                            |
                                            |
                                            |
                                    7 0 3   1 7 2  0 1 9
                                            |
                                            |
                                            |
                                    3 7 0  3 5 2    1 0 9    0 7 3     
                                           
                                           
0 7 3  
3 4 3
0 4 6
3 1 6
0 1 9
1 0 9
1 7 2
3 5 2
*/


   
var capacities = [3, 7, 10],
    globalList = [];

var count = 1,
    numOfTries;

// N-ary tree Node constructor
function Node(data) {
    this.data = this.head = data;
    this.children = [];
    this.id = guid();
}
// NaryTree Constructor
function NaryTree() {
    this.contents = this.head = [];
    this.children = [];
    this.id = guid();
}

function solvePuzzle() {
    numOfTries = 1,
        count = 1;
    var naryTree = new NaryTree();

    var treeJSON = [(insertNode(naryTree, [0, 0, 10]))];

    // remove all empty children
    clearProperty(treeJSON);

    if (!$('#tree').is(':empty')) {
        $('#tree').empty();
    }

    // empty tree check
    if (treeJSON[0]) {
        $("#tree").nadyTree({
            callType: 'obj',
            structureObj: treeJSON
        });
    }

    // empty all JSON and globalList
    clearProperty(treeJSON, 'ALL');
    clearProperty(naryTree, 'ALL');
    globalList = [];
}



function insertNode(naryTree, data) {
    var tree = null;
    var matchFound = false;
    if (naryTree.contents.length === 0) { // empty tree condition
        naryTree.contents = data.slice(); // store this in global array
        globalList.push(naryTree.contents);
        naryTree.head = 1;
        naryTree.id = guid();
        pushChildren(naryTree.children, solve(data, 0));
    } else {
        // traverse tree to leaf nodes and insert here
        // below for loop logic needs to be changed
        var leaves = getLeafNodes([naryTree]).slice();
        for (var p = 0; p < leaves.length; p++) {
            // search node and insert children in matched node only
            var parentToInsert = traverse(leaves, 'contents', leaves[p].contents.slice());
            var nextStates = solve(leaves[p].contents.slice(), 0);
            var states = [];
            // remove infinite loop causing nodes from nextStates by checking from global list and removing cyclic nodes
            nextStates.some(function(itemArr) {
                if (!inTree(itemArr)) {
                    states.push(itemArr);
                }
            });

            // exception case where the logic of isCyclic needs to be re-evaluated
            if (numOfTries > 4) {
                states = reevaluate(nextStates); // backtrack here
                // reset number of solve attempts at the level
                //numOfTries = 0;
            }

            pushChildren(parentToInsert.children, states);
            // check if solve returns the quantity to be measured. If YES then break.
            matchFound = nextStates.some(function(arr) {
                return arr.some(function(item) {
                    return item === parseInt($("#quantity").val());
                });
            });
        }
    }

    if (numOfTries > 10) {
        alert("Quantitity cannot be measured");
        return [];
    }

    if (!matchFound) {
        numOfTries++;
        naryTree = insertNode(naryTree, data);
    }
    return naryTree;
}

function reevaluate(statesArr) {
    var state = [];
    var flag = false;
    for (var index = 0; index < statesArr.length; index++) {
        var retStates = solve(statesArr[index].slice(), 0);
        flag = retStates.some(function(itemArr) {
            if (!inTree(itemArr)) {
                state = [itemArr];
                return itemArr;
            }
        });
        if (flag) {
            return state;
        }
    }
    return state;
}

function pushChildren(parent, children) {
    for (var index = 0; index < children.length; index++) {
        var node = new Node();
        node.contents = children[index].slice(); // store this in global array
        globalList.push(node.contents);
        node.head = ++count;
        node.id = guid();
        node.children = [];
        parent.push(node);
    }
}

function traverse(object, key, value) {
    var result = null;
    for (var i in object) {
        if (!!object[i] && typeof(object[i]) === "object") {
            if (object[i][key] && isEqual(object[i][key], value)) {
                return object[i];
            } else {
                result = traverse(object[i], key, value);
            }
        }
    }
    return result;
}




function clearProperty(JsonObj, isALL = false) {
    $.each(JsonObj, function(key, value) {
        if (isALL || value instanceof Array && value.length === 0 && JsonObj[key]) {
            delete JsonObj[key];
        } else if (typeof(value) === "object") {
            JsonObj[key] = clearProperty(value);
        }
    });
    return JsonObj;
}

function getLeafNodes(nodes, result = []) {
    for (var i = 0, length = nodes.length; i < length; i++) {
        if (!nodes[i].children.length) {
            result.push(nodes[i]);
        } else {
            result = getLeafNodes(nodes[i].children, result);
        }
    }
    return result;
}

function inTree(node) {
    var a1 = node.slice();
    var flag = globalList.some(function(arr) {
        var a2 = arr.slice();
        return isCyclic(a1, a2);
    });
    //console.log("Searching for", node, "in ", globalList, "Flag = ", flag);
    return flag;
}

function isCyclic(a1, a2) {
    var found = false;
    var a3 = a1.slice().sort();
    var a4 = a2.slice().sort();
    return a3.every(function(v, i) {
        return (v === a4[i]);
    });
    //return found;
}

function isEqual(a1, a2) {
    return a1 && a2 && a1.length === a2.length && a1.every(function(v, i) {
        return v === a2[i]
    });
}


function solve(quantities, count) {
    var source = [],
        destination = [],
        result = [];
    for (var i = 0; i < quantities.length; i++) {
        if (quantities[i] < capacities[i]) {
            destination.push(i);
        }
        if (quantities[i] > 0) {
            source.push(i);
        }
    }

    // clone the previous quantities configuration
    var savedQuantities = quantities.slice();

    for (var x = 0; x < source.length; x++) {
        for (var y = 0; y < destination.length; y++) {
            if (source[x] !== destination[y] && quantities[destination[y]] < capacities[destination[y]]) {
                var liquidToAdd = capacities[destination[y]] - quantities[destination[y]],
                    liquidToSubtract = (liquidToAdd > quantities[source[x]]) ? quantities[source[x]] : liquidToAdd;
                quantities[destination[y]] = quantities[destination[y]] + liquidToSubtract;
                quantities[source[x]] = quantities[source[x]] - liquidToSubtract;
                // restore the previous quantities configuration from cloned copy
                result.push(quantities);
                quantities = savedQuantities.slice();
            }
        }
    }

    return result;
}