Bruteforce dice possibility calculator

PossibilityUtils.cs

using System;

namespace Tests
{
    public static class PossibilityUtils
    {
        
        public static float GetMoreOrEqualPossibilitySum(int dicesCount, int dice, int target)
        {
            var allPossibilies = (int)Math.Pow(dice, dicesCount);
            var goodSumCount = 0;
            var sums = new int[allPossibilies];
            var indexes = new int[dicesCount];
            for (int i = 0; i < dicesCount; i++)
            {
                indexes[i] = 1;
            }
            var index = 0;
            var checkFinish = false;
            while (true)
            {
                var currentSum = 0;
                for (int i = 0; i < dicesCount; i++)
                {
                    currentSum += indexes[i];
                }
                sums[index] = currentSum;
                if (checkFinish)
                    break;
                var currentDigit = dicesCount - 1;
                if (indexes[currentDigit] < dice)
                {
                    indexes[currentDigit]++;
                }
                else
                {
                    var isTransfer = indexes[currentDigit] == dice;
                    while (currentDigit >= 0)
                    {
                        if (indexes[currentDigit] == dice && isTransfer)
                        {
                            indexes[currentDigit] = 1;
                        }
                        else
                        {
                            if (isTransfer)
                            {
                                indexes[currentDigit]++;
                                isTransfer = false;
                            }
                        }
                        currentDigit--;
                    }
                }
                var currentCheck = true;
                for (int i = 0; i < dicesCount; i++)
                {
                    if (indexes[i] == dice) continue;
                    currentCheck = false;
                    break;
                }
                if (currentCheck)
                    checkFinish = true;
                index++;
            }
            foreach (var sum in sums)
            {
                if (sum >= target)
                    goodSumCount++;
            }
            return (float)goodSumCount / allPossibilies;
        }
        
        public static float GetMoreOrEqualAtLeastOnePossibility(int dicesCount, int dice, int target)
        {
            var allPossibilies = (int)Math.Pow(dice, dicesCount);
            var goodCaseCount = 0;
            var max = new int[allPossibilies];
            var indexes = new int[dicesCount];
            for (int i = 0; i < dicesCount; i++)
            {
                indexes[i] = 1;
            }
            var index = 0;
            var checkFinish = false;
            while (true)
            {
                var currentMax = 0;
                for (int i = 0; i < dicesCount; i++)
                {
                    if (currentMax < indexes[i])
                        currentMax = indexes[i];
                }
                max[index] = currentMax;
                if (checkFinish)
                    break;
                var currentDigit = dicesCount - 1;
                if (indexes[currentDigit] < dice)
                {
                    indexes[currentDigit]++;
                }
                else
                {
                    var isTransfer = indexes[currentDigit] == dice;
                    while (currentDigit >= 0)
                    {
                        if (indexes[currentDigit] == dice && isTransfer)
                        {
                            indexes[currentDigit] = 1;
                        }
                        else
                        {
                            if (isTransfer)
                            {
                                indexes[currentDigit]++;
                                isTransfer = false;
                            }
                        }
                        currentDigit--;
                    }
                }
                var currentCheck = true;
                for (int i = 0; i < dicesCount; i++)
                {
                    if (indexes[i] == dice) continue;
                    currentCheck = false;
                    break;
                }
                if (currentCheck)
                    checkFinish = true;
                index++;
            }
            foreach (var value in max)
            {
                if (value >= target)
                {
                    goodCaseCount++;       
                }
            }
            return (float)goodCaseCount / allPossibilies;
        }
    }
}