コードが想定よりもはるかに多く実行されるのはなぜですか？

私は現在ポーカーオッズジェネレーターに取り組んでいますが、1つを除いて、ほぼ完了しています。プログラムは、本来よりもはるかに頻繁に実行されます。これはcompare()関数からのものであることがわかっています。Qメイン関数playPoker()が実行された回数を追跡するために変数を追加すると、コメントアウトするまで膨大な数が生成されます。コメントアウトすると、正確な数Iが返されます。期待します。

私がこれでどこが間違っているのか、誰かが指摘できますか？1つの関数がQ、本来よりもはるかに多くインクリメントされることにつながる理由がわかりません。文字通り、最後に実行したときの数は（100ではなく32,487）でした。以下にコードを示します（ポーカーのハンドチェック機能はそれほど重要ではないため、機能はありません）。なんでplayPoker()そんなに何度も走っているの？

var Q = 0;

function playPoker(tableSize) {

//Create the players, the deck and the card table which stores the 5 cards the players have in common
var players = createPlayers(tableSize);
var deck = createDeck();
var cardTable = new CardTable();

//Deal each player two cards
for (i = 0; i < 2; i++) {
    for (j = 0; j < players.length; j++) {
        deal(deck, players[j]);
    }
}

//Put five cards down on the table
for (k = 0; k < 5; k++) {
    deal(deck, cardTable);
}

//Check for various winning hands here for each player
for (m = 0; m < players.length; m++) {

    //Merge the player's two cards with the five cards on the table
    var subjectCards = (players[m].cards).concat(cardTable.cards);

    //Make an array of the values of each of the seven cards, which will be used to determine 4 of a kind, 3 of a kind and pairs
    var valuesInOrder = getValuesInOrder(subjectCards);

    //Create a dummy array, so that valuesInOrder remains unchanged
    var straightValues = valuesInOrder.slice();

    //Remove any duplicate card, meaning that the array contains only unique values (i.e. 2, 4, 5, 7, K ... NOT 2, 2, 2, 8, K, K, A)
    var straightValues = straightenUp(straightValues);

    //Calculate how many pairs are in the hand
    var numPairs = howManyPairs(valuesInOrder, straightValues, players[m]);

    //Find out whether the 5 table cards contain three cards of the same suit. If not, then a flush is impossible.
    var flushPotential = threeSameSuit(cardTable.cards);

    //Find out which hand each player has (i.e. straight, 3OAK, pair)
    checkPokerHand(subjectCards, straightValues, valuesInOrder, flushPotential, numPairs, players[m])
}

var rankedPlayers = compare(players);

//return players;

Q++;
return Q;

}

そして、これがそれを引き立たせるforループです。

for (z = 0; z < 100; z++;) {
    playPoker(4);
}

そして、これがcompare()機能です：

function compare(players) {

var remPlayers = players.slice();

var rankings = [];
var potentialWinners = [];

//Collect all the players' rankings in an array
for (i = 0; i < remPlayers.length; i++) {
    rankings.push(remPlayers[i].rank);
}

//Find the highest ranking
var highestRank = getHighestValue(rankings);

//Move any players with the highest ranking to an array for potential winners
for (j = 0; j < remPlayers.length; j++) {
    if (remPlayers[j].rank == highestRank) {
        potentialWinners.push(remPlayers[j]);
        remPlayers.splice(j, 1);
        j--;
    }
}

//With all potential winners gone, mark all other players with an L for losing.
for (k = 0; k < remPlayers.length; k++) {
    remPlayers[k].result = 'L'
}

var foundWinner = false;

if (potentialWinners.length < 2) {
    potentialWinners[0].result = 'W';
    foundWinner = true;
}

//Check there is more than one potential winner. If not, the only guy in the array has won.
if (!foundWinner) {

    //Loop through all players first cards and find the highest value, then delete any who don't have that, marking them with 'L'.
    //If there is no single remnant, do the same for second cards, then third, then fourth, etc.
    for (p = 0; p < 5; p++) {
        var subRankings = [];
        for (q = 0; q < potentialWinners.length; q++) {
            subRankings.push(potentialWinners[q].bestHand[p]);
        }
        var highestSubRanking = getHighestValue(subRankings);
        //Mark 'L' and remove any player who does not meet the highest subranking
        for (m = 0; m < potentialWinners.length; m++) {
            if (potentialWinners[m].bestHand[p] < highestSubRanking) {
                potentialWinners[m].result = 'L';
                potentialWinners.splice(m, 1);
            }
            if (potentialWinners.length < 2) {
                potentialWinners[0].result = 'W';
                //Set this flag to true to break the loop because a winner has been found
                foundWinner = true;
                break;
            }
        }

        //Break the loop if we have found a winner
        if (foundWinner) {
            break;
        }

        //If we still haven't found a winner by the end of the 5th loop, all remaining players draw
        if (p == 4) {
            for (z = 0; z < potentialWinners.length; z++) {
                potentialWinners[z].result = 'D';
            }
        }
        if (foundWinner) {
            break;
        }
    }
}
return players;
}