Огнян обнови решението на 29.11.2022 10:42 (преди почти 2 години)
+chess_figures = {
+ 'r': 5,
+ 'n': 3,
+ 'b': 3,
+ 'q': 5,
+ 'k': 4,
+ 'p': 1,
+}
+
+
+class ChessException(Exception):
+ def __init__(self, message='Wrong chess.'):
+ self._message = message
+ super().__init__(self._message)
+
+
+class ChessPosition:
+
+ def __kings_amount(self, fen):
+ if 0 < fen.count('k') < 2 or 0 < fen.count('K') < 2:
+ return False
+ return True
+
+ def __kings_positions(self, fen):
+ for i_row, row in enumerate(fen):
+ for i_figure, figure in enumerate(row):
+ if i_row == 0 and figure == 'k':
+ if (i_figure == 0 and figure == 'k' and
+ (fen[0][1] == 'k' or fen[1][0] == 'k' or fen[1][1] == 'k')):
+ return True
+ elif (i_figure == 7 and figure == 'k' and
+ (fen[0][6] == 'k' or fen[1][7] == 'k' or fen[1][6] == 'k')):
+ return True
+ elif (figure == 'k' and
+ (fen[0][i_figure - 1] == 'k' or fen[0][i_figure + 1] == 'k' or
+ fen[1][i_figure] == 'k' or fen[1][i_figure - 1] == 'k' or fen[1][i_figure + 1] == 'k')):
+ return True
+
+ elif i_row == 7 and figure == 'k':
+ if (i_figure == 0 and figure == 'k' and
+ (fen[7][1] == 'k' or fen[6][0] == 'k' or fen[6][0] == 'k')):
+ return True
+ elif (i_figure == 7 and figure == 'k' and
+ (fen[7][6] == 'k' or fen[6][7] == 'k' or fen[6][6] == 'k')):
+ return True
+ elif (figure == 'k' and
+ (fen[7][i_figure - 1] == 'k' or fen[7][i_figure + 1] == 'k' or
+ fen[6][i_figure] == 'k' or fen[6][i_figure - 1] == 'k' or fen[6][i_figure + 1] == 'k')):
+ return True
+
+ elif figure == 'k':
+ if (i_figure == 0 and figure == 'k' and
+ (fen[i_row - 1][i_figure] == 'k' or fen[i_row + 1][i_figure] == 'k' or
+ fen[i_row - 1][i_figure + 1] == 'k' or fen[i_row + 1][i_figure + 1] == 'k' or fen[i_row][i_figure + 1] == 'k')):
+ return True
+ elif (i_figure == 7 and figure == 'k' and
+ (fen[i_row - 1][i_figure] == 'k' or fen[i_row + 1][i_figure] == 'k' or
+ fen[i_row - 1][i_figure - 1] == 'k' or fen[i_row + 1][i_figure - 1] == 'k' or fen[i_row][i_figure - 1] == 'k')):
+ return True
+ elif (figure == 'k' and
+ fen[i_row - 1][i_figure] == 'k' or fen[i_row + 1][i_figure] == 'k' or
+ fen[i_row - 1][i_figure + 1] == 'k' or fen[i_row + 1][i_figure + 1] == 'k' or fen[i_row][i_figure + 1] == 'k' or
+ fen[i_row - 1][i_figure - 1] == 'k' or fen[i_row + 1][i_figure - 1] == 'k' or fen[i_row][i_figure - 1] == 'k'):
+ return True
+
+ return False
+
+ def __pawns_positions(self, fen):
+ for i_row, row in enumerate(fen):
+ for figure in row:
+ if figure == 'p' and (i_row == 0 or i_row == 7):
+ return True
+ return False
+
+ def __init__(self, fen):
+ self.fen = fen
+ splited = fen.lower().split('/')
+ if (self.__kings_amount(fen) or self.__kings_positions(splited)):
+ raise ChessException('kings')
+ elif (self.__pawns_positions(splited)):
+ raise ChessException('pawns')
+
+ def get_white_score(self):
+ white_figures = []
+ for figure in self.fen:
+ if figure not in chess_figures and figure.isalpha():
+ white_figures.append(figure.lower())
+ return ChessScore(white_figures)
+
+ def get_black_score(self):
+ black_figures = []
+ for figure in self.fen:
+ if figure in chess_figures:
+ black_figures.append(figure)
+ return ChessScore(black_figures)
+
+ def white_is_winning(self):
+ return self.get_white_score > self.get_black_score
+
+ def black_is_winning(self):
+ return self.get_white_score < self.get_black_score
+
+ def is_equal(self):
+ return self.get_white_score == self.get_black_score
+
+ def __str__(self):
+ return self.fen
+
+ def __len__(self):
+ figures_amount = 0
+ for figure in self.fen:
+ if (figure.isalpha()):
+ figures_amount += 1
+ return figures_amount
+
+ def __getitem__(self, position):
+ letters = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H']
+ row = 0
+ col = 0
+ for item in position:
+ if item.isalpha():
+ col = letters.index(item)
+ else:
+ row = item
+ if self.fen.split('/')[row][col].isalpha():
+ return self.fen.split('/')[row][col]
+ else:
+ return None
+
+
+class ChessScore:
+ def __init__(self, figures):
+ figures_value = 0
+ for figure in figures:
+ if figure not in (chess_figures):
+ raise ChessException('Wrong figures.')
+ else:
+ figures_value += chess_figures[figure]
+
+ self.figures = figures
+ self.figures_value = figures_value
+
+ def __gt__(self, other): # >
+ if isinstance(other, ChessScore):
+ return self.figures_value > other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __ge__(self, other): # >=
+ if isinstance(other, ChessScore):
+ return self.figures_value >= other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __lt__(self, other): # <
+ if isinstance(other, ChessScore):
+ return self.figures_value < other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __le__(self, other): # <=
+ if isinstance(other, ChessScore):
+ return self.figures_value <= other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __eq__(self, other): # ==
+ if isinstance(other, ChessScore):
+ return self.figures_value == other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __ne__(self, other): # !=
+ if isinstance(other, ChessScore):
+ return self.figures_value != other.figures_value
+ else:
+ raise NotImplemented()
+
+ def __add__(self, other):
+ if isinstance(other, ChessScore):
+ new_figure_value = self.figures_value.copy()
+ new_figure_value += other.figures_value
+ return new_figure_value
+ else:
+ raise NotImplemented()
+
+ def __sub__(self, other):
+ if isinstance(other, ChessScore):
+ new_figure_value = self.figures_value.copy()
+ new_figure_value -= other.figures_value
+ return new_figure_value
+ else:
+ raise NotImplemented()
+
+ def __iadd__(self, other):
+ if isinstance(other, ChessScore):
+ self.figures_value += other.figures_value
+ return self
+ else:
+ raise NotImplemented()
+
+ def __isub__(self, other):
+ if isinstance(other, ChessScore):
+ self.figures_value -= other.figures_value
+ return self
+ else:
+ raise NotImplemented()
+
Можеш да минеш и само с един
passв тялото на класа, защото този инициализатор реално не прави нищо.Според мен е по-добре с една долна черта: https://fmi.py-bg.net/team
Освен това, моля слагай
__init__на първо място.Бих запазаил резултатът от този метод като атрибут на инстанцията, за да не минаваш всеки път през този метод, когато ти трябва да работиш с дъската.
Един от малкото хора, които са се сетили да се застраховат, че
otherе от същия тип - поздравления! Като отключим решенията, можеш да видиш как съм дефинирал тази застраховка чрез декоратор, за да спестя дублиране на код.