def traverseTreeForBestMove(self, side, moveTree,
                                layersTraversed, bestMovesFound):
        if self.depth < layersLeft:
            for move in moveTree:
                board.makeMove(move)
                return traverseTreeForBestMove(moveTree[move],
                                               layersLeft+1, bestMoveFound)
        if layersLeft == self.depth:
            for move in moveTree:
                board.makeMove(move)
                pointAdvantage = board.getPointAdvantageOfSide(side)
                previousBestAdvantage = 1
                return move
dataset/ETHPy150Open marcusbuffett/command-line-chess/build/lib/chess/AI.py/AI.traverseTreeForBestMove/swapped operands of `<`