Abstract
Abstract This paper investigates a simple, constructive search strategy: an incomplete version of Ginsberg's Dynamic Backtracking which records no information during search, and randomly selects variables for backtracking. Combining this with forward checking and dynamic variable ordering heuristics we obtain algorithms for constraint satisfaction problems, and by adding branch-and-bound we obtain optimization algorithms. Testing these on several classes of 1000-vertex graph colouring problems we find colourings which are competitive with those of specialized algorithms: a 92-colouring for a random graph (p = 0.5), hidden k-colourings in equipartite graphs (p = 0.5) for k ≤ 60 and improved results for geometric graphs. An interesting aspect is that most of our results were obtained using the precise opposite of the well-known first-fail principle.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
