MoveValidator.py

from lib2to3.pgen2.driver import Driver
import pygame
from MartianField import MartianField
from MartianPiece import MartianPiece, PAWN, DRONE, QUEEN

class MoveValidator:

    def IsValidMove(self, selectedPiece: MartianPiece, field: MartianField, pieces: list[MartianPiece]):
      
      if selectedPiece.pieceType == PAWN:
      # One space at a time, in any of the diagonal directions
        return max(selectedPiece.row, field.row) - min(selectedPiece.row, field.row) == 1 \
              and max(selectedPiece.column, field.column) - min(selectedPiece.column, field.column) == 1

      if selectedPiece.pieceType == DRONE:
      #  One or two spaces, on either the horizontal or vertical lines. Jumping is not allowed.
        if selectedPiece.row == field.row and max(selectedPiece.column, field.column) - min(selectedPiece.column, field.column) == 1:
          return True
        
        if selectedPiece.column == field.column and max(selectedPiece.row, field.row) - min(selectedPiece.row, field.row) == 1:
          return True
        
        if selectedPiece.row == field.row \
          and max(selectedPiece.column, field.column) - min(selectedPiece.column, field.column) == 2 \
          and self.fieldIsEmpty(min(selectedPiece.column, field.column) + 1, selectedPiece.row, pieces):
          return True

        if selectedPiece.column == field.column \
          and max(selectedPiece.row, field.row) - min(selectedPiece.row, field.row) == 2 \
          and self.fieldIsEmpty(selectedPiece.column, min(selectedPiece.row, field.row) + 1, pieces):
          return True
        
        return False

      if selectedPiece.pieceType == QUEEN:
        # Any distance, in any straight-line direction: horizontally, vertically, or diagonally. Jumping is not allowed.
                
        if selectedPiece.column == field.column:
          for r in range(min(selectedPiece.row, field.row) + 1, max(selectedPiece.row, field.row)):
            if not self.fieldIsEmpty(selectedPiece.column, r, pieces):
              return False
          return True

        if selectedPiece.row == field.row:
          for c in range(min(selectedPiece.column, field.column) + 1, max(selectedPiece.column, field.column)):
            if not self.fieldIsEmpty(c, selectedPiece.row, pieces):
              return False
          return True

        if abs(selectedPiece.row - field.row) == abs(selectedPiece.column - field.column):
          if (abs(selectedPiece.row - field.row) == 1):
            return True
          slope = 1 \
            if selectedPiece.column > field.column and selectedPiece.row > field.row \
            or selectedPiece.column < field.column and selectedPiece.row < field.row \
            else -1

          for i in range(1, abs(selectedPiece.row - field.row)):
            if not self.fieldIsEmpty(min(selectedPiece.column, field.column) + i * slope, min(selectedPiece.row, field.row) + i, pieces):
              return False
            return True

      return False

    def fieldIsEmpty(self, column: int, row: int, pieces: list[MartianPiece]):
        for piece in pieces:
          if piece.isCapturedByPlayer != None:
            return True          
          if piece.column == column and piece.row == row:
            return False
        return True