PDF-Software Engineering Abdelghani Bellaachia Page Backtracking Examples Maze problem The bicycle lock problem Consider a lock with N switches each of which can be either or
We know that the combination that opens the lock should have at least 1s Note The total number of combinations is 2 The solution space can be modeled by a tree Finish
Download Presentation
"Software Engineering Abdelghani Bellaachia Page Backtracking…" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.