old_version/solver.py
def insert_digit_if_only_one_possible_position_in_square(self, digit: int, positions_in_squares: Dict[
        int, List[Tuple[int, int]]]) -> None:
        """
        If there is only one available (for aur number) blank cell inside a square, it can be filled.
        Function inserts a number and sets sudoku array status on "changed".
        :param digit: evaluating number
        :param positions_in_squares: list of available blank cells' coordinates divided by squares
        :return: None
        """
        for square in positions_in_squares:
            if len(positions_in_squares[square]) == 1:
                row_index, column_index = positions_in_squares[square][0][0], positions_in_squares[square][0][1]
                self.insert_and_set_changed(digit, row_index, column_index)
        return None

        If there is only one available (for aur number) blank cell inside a square, it can be filled.
        Function inserts a number and sets sudoku array status on "changed".
        :param digit: evaluating number
        :param positions_in_squares: list of available blank cells' coordinates divided by squares
        :return: None
        
If there is only one available (for aur number) blank cell inside a square, it can be filled.
Function inserts a number and sets sudoku array status on "changed".
If there is only one available ( for aur number ) blank cell inside a square it can be filled . Function inserts a number and sets sudoku array status on " changed " .
def insert_digit_if_only_one_possible_position_in_square(self, digit: int, positions_in_squares: Dict[
        int, List[Tuple[int, int]]]) -> None:
        for square in positions_in_squares:
            if len(positions_in_squares[square]) == 1:
                row_index, column_index = positions_in_squares[square][0][0], positions_in_squares[square][0][1]
                self.insert_and_set_changed(digit, row_index, column_index)
        return None
def insert_digit_if_only_one_possible_position_in_square ( self , digit : int , positions_in_squares : Dict [ int , List [ Tuple [ int , int ] ] ] ) -> None : for square in positions_in_squares : if len ( positions_in_squares [ square ] ) == 1 : row_index , column_index = positions_in_squares [ square ] [ 0 ] [ 0 ] , positions_in_squares [ square ] [ 0 ] [ 1 ] self . insert_and_set_changed ( digit , row_index , column_index ) return None
If there is only one available (for aur number) blank cell inside a square, it can be filled.
If there is only one available ( for aur number ) blank cell inside a square it can be filled .
"""
        If there is only one available (for aur number) blank cell inside a square, it can be filled.
        Function inserts a number and sets sudoku array status on "changed".
        :param digit: evaluating number
        :param positions_in_squares: list of available blank cells' coordinates divided by squares
        :return: None
        """
None
self
digit
int
None
positions_in_squares
Dict[
        int, List[Tuple[int, int]]]
list of available blank cells' coordinates divided by squares
list of available blank cells ' coordinates divided by squares