Algorithms and Data Structures

More documents

Recommendations

Info

N.Wirth. Algorithms and Data Structures. Oberon version 112 be given the value 1; all others are to be marked free. VAR h: ARRAY n, n OF INTEGER; (* ADenS34_KnightsTour *) dx, dy: ARRAY 8 OF INTEGER; PROCEDURE CanBeDone (u, v, i: INTEGER): BOOLEAN; VAR done: BOOLEAN; BEGIN h[u, v] := i; TryNextMove(u, v, i, done); IF ~done THEN h[u, v] := 0 END; RETURN done END CanBeDone; PROCEDURE TryNextMove (x, y, i: INTEGER; VAR done: BOOLEAN); VAR eos: BOOLEAN; u, v: INTEGER; k: INTEGER; PROCEDURE Next (VAR eos: BOOLEAN; VAR u, v: INTEGER); BEGIN REPEAT INC(k); IF k < 8 THEN u := x + dx[k]; v := y + dy[k] END; UNTIL (k = 8) OR ((0
N.Wirth. Algorithms and Data Structures. Oberon version 113 23 10 15 4 25 16 5 24 9 14 11 22 1 18 3 6 17 20 13 8 21 12 7 2 19 23 4 9 14 25 10 15 24 1 8 5 22 3 18 13 16 11 20 7 2 21 6 17 12 19 1 16 7 26 11 14 34 25 12 15 6 27 17 2 33 8 13 10 32 35 24 21 28 5 23 18 3 30 9 20 36 31 22 19 4 29 Table 3.1. Three Knights' Tours. What abstractions can now be made from this example? Which pattern does it exhibit that is typical for this kind of problem-solving algorithms? What does it teach us? The characteristic feature is that steps toward the total solution are attempted and recorded that may later be taken back and erased in the recordings when it is discovered that the step does not possibly lead to the total solution, that the step leads into a dead-end street. This action is called backtracking. The general pattern below is derived from TryNextMove, assuming that the number of potential candidates in each step is finite. PROCEDURE Try; BEGIN IF solution incomplete THEN initialize selection of candidates and choose the first one; WHILE ~(no more candidates) & ~CanBeDone(candidate) DO select next END END END Try; PROCEDURE CanBeDone (move): BOOLEAN; BEGIN record move; Try; IF not successful THEN cancel recording END; RETURN successful END CanBeDone Actual programs may, of course, assume various derivative forms of this schema. In particular, the way input is passed to TryNextMove may vary depending on the problem specifics. Indeed, this procedure accesses global variables in order to record the solution, and those variables contain, in principle, a complete information about the current state of the construction process. For instance, in the knight's tour problem TryNextMove needs to know the knight's last position on the board, which can be found by a search in the matrix h. However, this information is explicitly available when the procedure is called, and it is simpler to pass it via parameters. In subsequent examples we will see variations on this theme. Note that the search condition in the while loop is modeled as a procedure-function CanBeDone for a maximal clarification of the logic of the algorithm while keeping the program easily comprehensible.
Page 1 and 2:
Algorithms and Data Structures © N
Page 3 and 4:
N.Wirth. Algorithms and Data Struct
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62: N.Wirth. Algorithms and Data Struct
Page 111: N.Wirth. Algorithms and Data Struct
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211:
show all

Algorithms and Data Structures

Create successful ePaper yourself

Delete template?

Save as template?