0% found this document useful (0 votes)
27 views

Backtracking: Intensiv 2009

The document discusses backtracking as a problem-solving technique that can be used to efficiently solve complex problems by incrementally building candidates to the solutions, and abandoning a candidate ("backtracking") as soon as it is determined that the candidate cannot possibly be completed to a valid solution. The document outlines several examples where backtracking can be applied, such as solving puzzles, constraint satisfaction problems, and parsing and pattern recognition. It also describes the general backtracking algorithm and some techniques to optimize it, such as pruning search spaces and memorization.

Uploaded by

LilianaUrsache
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views

Backtracking: Intensiv 2009

The document discusses backtracking as a problem-solving technique that can be used to efficiently solve complex problems by incrementally building candidates to the solutions, and abandoning a candidate ("backtracking") as soon as it is determined that the candidate cannot possibly be completed to a valid solution. The document outlines several examples where backtracking can be applied, such as solving puzzles, constraint satisfaction problems, and parsing and pattern recognition. It also describes the general backtracking algorithm and some techniques to optimize it, such as pruning search spaces and memorization.

Uploaded by

LilianaUrsache
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Backtracking

1.

2.

3.

4.

5.

6.

7.
8.

9.

10.

Intensiv
2009

Backtracking
11

12

13

15
16
17

18
19

20

21

22

Intensiv
2009

Backtracking
23

24

25

26

27

28

29
30

31

Intensiv
2009

Backtracking
32

33

34

35

36

37

38

39

47

Intensiv
2009

Backtracking
48

49

50

Intensiv
2009

You might also like