Introduction

• Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably Constraint satisfaction problems (CSPs), which incrementally builds candidates to the solution
• And abandons a candidate ("backtracks") as soon as it determines that the candidate cannot lead to a valid solution

You Will Know

• Backtracking Pseudo Template

Why Should You Learn These

Contents

Click cmd/ctrl + option/alt + T to expand all toggles

1. Backtracking Pseudo Template

2. General Problems

Conclusions

References

• link1

Further Readings

• a further reading for topic 1

Note