old_version/solver.py
def check_stack(self) -> None:
        """
        For all elements in stack function checks if element can be easly solve and solves that element.
        Stack can be incremented during a process, so function runs as long as there are no more elements to check.
        :return: None
        """
        self.s.unchecked_stack = list(set(self.s.unchecked_stack))
        while len(self.s.unchecked_stack):
            self.fill_element(self.s.unchecked_stack[0])
            self.s.unchecked_stack.pop(0)
            self.s.unchecked_stack = list(set(self.s.unchecked_stack))
        return None

        For all elements in stack function checks if element can be easly solve and solves that element.
        Stack can be incremented during a process, so function runs as long as there are no more elements to check.
        :return: None
        
For all elements in stack function checks if element can be easly solve and solves that element.
Stack can be incremented during a process, so function runs as long as there are no more elements to check.
For all elements in stack function checks if element can be easly solve and solves that element . Stack can be incremented during a process so function runs as long as there are no more elements to check .
def check_stack(self) -> None:
        self.s.unchecked_stack = list(set(self.s.unchecked_stack))
        while len(self.s.unchecked_stack):
            self.fill_element(self.s.unchecked_stack[0])
            self.s.unchecked_stack.pop(0)
            self.s.unchecked_stack = list(set(self.s.unchecked_stack))
        return None
def check_stack ( self ) -> None : self . s . unchecked_stack = list ( set ( self . s . unchecked_stack ) ) while len ( self . s . unchecked_stack ) : self . fill_element ( self . s . unchecked_stack [ 0 ] ) self . s . unchecked_stack . pop ( 0 ) self . s . unchecked_stack = list ( set ( self . s . unchecked_stack ) ) return None
For all elements in stack function checks if element can be easly solve and solves that element.
For all elements in stack function checks if element can be easly solve and solves that element .
"""
        For all elements in stack function checks if element can be easly solve and solves that element.
        Stack can be incremented during a process, so function runs as long as there are no more elements to check.
        :return: None
        """
None
self