old_version/solver.py
def solve(self) -> None:
        """
        Main solving sequence.
        Checks if there are blank cells where only one number can be inserted.
        :return: None
        """
        self.counter = 0
        self.s.possible_digits_in_cells = {coordinate: [] for coordinate in self.s.zero_positions}
        while self.counter < len(self.s.available_digits):
            self.check_available_digits()
        self.check_blank_cells()
        return None

        Main solving sequence.
        Checks if there are blank cells where only one number can be inserted.
        :return: None
        
Main solving sequence.
Checks if there are blank cells where only one number can be inserted.
Main solving sequence . Checks if there are blank cells where only one number can be inserted .
def solve(self) -> None:
        self.counter = 0
        self.s.possible_digits_in_cells = {coordinate: [] for coordinate in self.s.zero_positions}
        while self.counter < len(self.s.available_digits):
            self.check_available_digits()
        self.check_blank_cells()
        return None
def solve ( self ) -> None : self . counter = 0 self . s . possible_digits_in_cells = { coordinate : [ ] for coordinate in self . s . zero_positions } while self . counter < len ( self . s . available_digits ) : self . check_available_digits ( ) self . check_blank_cells ( ) return None
Main solving sequence.
Main solving sequence .
"""
        Main solving sequence.
        Checks if there are blank cells where only one number can be inserted.
        :return: None
        """
None
self