class Position:
    _RANKS = range(1, 9)
    _FILES = "abcdefgh"

    _MIN_POS = 0
    _MAX_POS = 7

    def __init__(self, x, y) -> None:
        assert x >= self._MIN_POS and x <= self._MAX_POS, f"Invalid argument: x should be between {self._MIN_POS} and {self._MAX_POS}, but is {x}"
        assert y >= self._MIN_POS and y <= self._MAX_POS, f"Invalid argument: y should be between {self._MIN_POS} and {self._MAX_POS}, but is {y}"

        self.x = x
        self.y = y

    @staticmethod
    def is_within_bounds(x: int, y: int) -> bool:
        return x >= Position._MIN_POS and x <= Position._MAX_POS \
            and y >= Position._MIN_POS and y <= Position._MAX_POS

    @staticmethod
    def from_algebraic(square: str) -> "Position":
        assert len(square) == 2, f"'{square}' is malformed"
        x = Position._FILES.index(square[0])
        y = Position._RANKS.index(int(square[1]))

        return Position(x, y)

    def to_algebraic(self) -> str:
        return f"{Position._FILES[self.x]}{Position._RANKS[self.y]}"

    def __eq__(self, value: object, /) -> bool:
        if type(value) != type(self):
            return False
        return value.x == self.x and value.y == self.y

    def __hash__(self) -> int:
        return hash((self.x, self.y))

    def __str__(self) -> str:
        return f"{Position._FILES[self.x]}{Position._RANKS[self.y]}"

    def __repr__(self) -> str:
        return str(self)