old_version/solver.py
def try_random_insert(self, max_tries: int = 10) -> None:
        """
        If Sudoku is still incomplete after previous solving procedure, program tries to use random insertions.
        It will insert digits chosen randomly from list of available digits.
        Insertion will occur on blank cell with minimum number of possible digits,
        so the probability for accurate choice is utmost.
        :param max_tries: maximum number of tries (random insertions)
        :return: None
        """
        number_of_tries = 0
        while len(self.s.zero_positions) and number_of_tries <= max_tries:
            self.random_check()
            number_of_tries += 1
        return None

        If Sudoku is still incomplete after previous solving procedure, program tries to use random insertions.
        It will insert digits chosen randomly from list of available digits.
        Insertion will occur on blank cell with minimum number of possible digits,
        so the probability for accurate choice is utmost.
        :param max_tries: maximum number of tries (random insertions)
        :return: None
        
If Sudoku is still incomplete after previous solving procedure, program tries to use random insertions.
It will insert digits chosen randomly from list of available digits.
Insertion will occur on blank cell with minimum number of possible digits,
so the probability for accurate choice is utmost.
If Sudoku is still incomplete after previous solving procedure program tries to use random insertions . It will insert digits chosen randomly from list of available digits . Insertion will occur on blank cell with minimum number of possible digits so the probability for accurate choice is utmost .
def try_random_insert(self, max_tries: int = 10) -> None:
        number_of_tries = 0
        while len(self.s.zero_positions) and number_of_tries <= max_tries:
            self.random_check()
            number_of_tries += 1
        return None
def try_random_insert ( self , max_tries : int = 10 ) -> None : number_of_tries = 0 while len ( self . s . zero_positions ) and number_of_tries <= max_tries : self . random_check ( ) number_of_tries += 1 return None
If Sudoku is still incomplete after previous solving procedure, program tries to use random insertions.
If Sudoku is still incomplete after previous solving procedure program tries to use random insertions .
"""
        If Sudoku is still incomplete after previous solving procedure, program tries to use random insertions.
        It will insert digits chosen randomly from list of available digits.
        Insertion will occur on blank cell with minimum number of possible digits,
        so the probability for accurate choice is utmost.
        :param max_tries: maximum number of tries (random insertions)
        :return: None
        """
None
self
max_tries
int
maximum number of tries (random insertions)
maximum number of tries ( random insertions )