HashMap<Integer, Integer> set = new HashMap<Integer, Integer>();


        for (int t = 0; t < 1000; t++) {
            tree = new Node(b, d, v, i, s);

            //tree.print();

            //System.out.println();

            negamaxResult = searcher.Negamax(tree, d, Integer.MIN_VALUE, Integer.MAX_VALUE, false, null);
            //System.out.println("NegamaxAlphaBeta --> " + negamaxResult.getValue());
            //System.out.println();

            if (!set.containsKey(negamaxResult.getValue())) {
                set.put(negamaxResult.getValue(), 1);
            } else {
                set.put(negamaxResult.getValue(), set.get(negamaxResult.getValue()) + 1);
            }
        }

        for (int key: set.keySet()) {
            System.out.println(key + ") " + set.get(key) + "\t" + (set.get(key) / 10.0) + "%");
        }