Method _traverse_l

Checker_game_by_dz/modules/checker_board.py:109–142

(self, start, stop, step, color, l, skip=[])

    # Traversal Left
    def _traverse_l(self, start, stop, step, color, l, skip=[]):
        moves = {}
        last = []
        for r in range(start, stop, step):
            if l < 0:
                break
            current = self.board[r][l]
            if current == 0:
                if skip and not last:
                    break
                elif skip:
                    moves[(r, l)] = last + skip
                else:
                    moves[(r, l)] = last

                if last:
                    if step == -1:
                        row = max(r - 3, 0)
                    else:
                        row = min(r + 3, rows)
                    moves.update(
                        self._traverse_l(r + step, row, step, color, l - 1, skip=last)
                    )
                    moves.update(
                        self._traverse_r(r + step, row, step, color, l + 1, skip=last)
                    )
                break

            elif current.color == color:
                break
            else:
                last = [current]
            l -= 1
        return moves

    # Traversal Right
    def _traverse_r(self, start, stop, step, color, right, skip=[]):