在 JavaScript 中的变量数组和常量数组集之间找到 3 个相等的元素

Question

我正在构建一个井字游戏。我目前正在尝试编写函数来检查是否有人赢得了比赛。我有一个包含一组数据的对象，其中包括一个多维数组，其中包含与棋盘上的方块相关的获胜“数字”的所有组合。每次你点击一个方格时，方格的编号都会被推送到每个玩家的单独数组中。

我目前的问题是循环并找出包含玩家当前方格的数组何时等于中奖号码数组之一。

我已经尝试了很多不同的方法，包括嵌套 for 循环的不同变体、使用包含、使用 indexOf，然后尝试控制台记录获胜消息或将随机值推送到单独的数组/变量当达到 3 表示胜利时，但实际上我现在精神崩溃了，希望任何人都可以提供任何建议。

   var game = {

   player: true,
   win: [[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,5],[2,5,8],[0,4,8],[2,4,6]], 
   //the above is my array of winning combinations
   p1Points: 0,
   p2Points: 0,
   p1Moves:[], //the place for players "moves" to be stored
   p2Moves:[]
        }

    function currentMove(square){
       var squareNum = square.data('squarenumber');
       square.off();
          if(game.player){
            square.html('x'); 
            game.p1Moves.push(squareNum);
            game.player = false;
           checkWin(game.win, game.p1Moves)
      }

      else{
            square.html('0');
            game.p2Moves.push(squareNum);
            game.player = true;}
            checkWin(game.win, game.p2Moves)
   }

   function checkWin(winArr, movesArr){

   /* this is the function I need help with, have tried multiple things
   it needs to return somthing to signal a player has won. e.g three in a 
   row. */




   }

Answer 1

你可以这样做：

function checkWin(winArr, movesArr){
  return winArr.some(function(win) {
    return win.join('') === movesArr.join('')
  })
}

如果找到获胜组合，这将返回 true/false。

编辑： 正如@rupps 提到的，不要忘记对其进行排序以保持顺序的一致性。

return win.join('') === movesArr.sort().join('')

Answer 2

我建议将玩家的移动存储在一个对象中而不是一个数组中，以便之后进行比较。所以你会有：

 if(game.player){
     square.html('x'); 

     // use indexed object
     game.p1Moves[squareNum] = true;

     game.player = false;
     checkWin(game.win, game.p1Moves)
 }

现在，

/**
 * Checks winning combination
 *
 * @param winArr Array of Array[3] of Winning Moves 
 * @param movesObj Object with moves
 */

function checkWin(winArr, movesObj) {

    // iterate through all Winning Combinations
    for (var i = 0, l = winArr.length; i<l; i++) {

        var combArray = winArr[i],    // *each* of the winning combination arrays
            count=0;                  // success counter for every combination

        // check winning move: all squares in player object must be full
        for (var j=0; j<3; j++) 
            if (movesObj[combArray[j]]) count++;

        // current winning move ok if its 3 squares full
        if (count == 3) return true;
    }

    // no winning move found
    return false;

}   

或者在最有效的版本中：

function checkWin(winArr, movesObj) {

    // iterate through all Winning Combinations
    for (var i = 0, count = 0, l = winArr.length; i < l; i++, count = 0) {

        // check winning move: all squares in player object must be full
        for (var j=0; j<3; j++) ( movesObj[winArr[i][j]] && (count++) );

        // current winning move ok if its 3 squares full
        if (count == 3) return true;
    }

    // no winning move found
    return false;

}