old_version/solver.py
def check_available_digits(self) -> None:
        """
        For given number function generates all permissible blank cells.
        Checks in squares, rows and columns if there is only one possible cell to insert the number.
        If all checks don't cause number insertion, function updates dictionary with all blank cells
        and their corresponding permissible digits.
        :return: None
        """
        digit = self.s.available_digits[self.counter]
        self.s.changed = False
        positions_in_squares = self.get_positions_in_squares(digit)
        self.insert_digit_if_only_one_possible_position_in_square(digit, positions_in_squares)
        if self.s.changed:
            self.after_change_procedure()
        else:
            potential_positions, solutions = self.positions_in_one_row_or_column(positions_in_squares)
            self.apply_solutions(digit, solutions)
            if self.s.changed:
                self.after_change_procedure()
            else:
                self.add_digit_to_blank_cells(digit, potential_positions)
        return None

        For given number function generates all permissible blank cells.
        Checks in squares, rows and columns if there is only one possible cell to insert the number.
        If all checks don't cause number insertion, function updates dictionary with all blank cells
        and their corresponding permissible digits.
        :return: None
        
For given number function generates all permissible blank cells.
Checks in squares, rows and columns if there is only one possible cell to insert the number.
If all checks don't cause number insertion, function updates dictionary with all blank cells
and their corresponding permissible digits.
For given number function generates all permissible blank cells . Checks in squares rows and columns if there is only one possible cell to insert the number . If all checks don ' t cause number insertion function updates dictionary with all blank cells and their corresponding permissible digits .
def check_available_digits(self) -> None:
        digit = self.s.available_digits[self.counter]
        self.s.changed = False
        positions_in_squares = self.get_positions_in_squares(digit)
        self.insert_digit_if_only_one_possible_position_in_square(digit, positions_in_squares)
        if self.s.changed:
            self.after_change_procedure()
        else:
            potential_positions, solutions = self.positions_in_one_row_or_column(positions_in_squares)
            self.apply_solutions(digit, solutions)
            if self.s.changed:
                self.after_change_procedure()
            else:
                self.add_digit_to_blank_cells(digit, potential_positions)
        return None
def check_available_digits ( self ) -> None : digit = self . s . available_digits [ self . counter ] self . s . changed = False positions_in_squares = self . get_positions_in_squares ( digit ) self . insert_digit_if_only_one_possible_position_in_square ( digit , positions_in_squares ) if self . s . changed : self . after_change_procedure ( ) else : potential_positions , solutions = self . positions_in_one_row_or_column ( positions_in_squares ) self . apply_solutions ( digit , solutions ) if self . s . changed : self . after_change_procedure ( ) else : self . add_digit_to_blank_cells ( digit , potential_positions ) return None
For given number function generates all permissible blank cells.
For given number function generates all permissible blank cells .
"""
        For given number function generates all permissible blank cells.
        Checks in squares, rows and columns if there is only one possible cell to insert the number.
        If all checks don't cause number insertion, function updates dictionary with all blank cells
        and their corresponding permissible digits.
        :return: None
        """
None
self