UPDATED: 2005-10-26
This list describes the known bugs and errors in the 2005 edition of the lecture notes. Typically, page and line numbers are given to localize the error. A negative line number indicates numbering from the bottom up. Actual text from the lecture notes is surrounded by (( )). Replacement text, where provided, is surrounded by || ||.
Chapter 1
Page 1, line 13
Change ((prevents)) to ||prevent||. Change ((to achieve)) to ||from achieving||.
Page 2, lines 2 and 3
Change ((a set rules)) to ||a set of rules||.
Page 3, line 12
Change ((good hand)) to ||good a hand||.
Page 3, line -8
Change ((obscures)) to ||obscure||.
Page 4, line -8
Change ((not to cover)) to ||not cover||.
Page 5, line 7
Change ((Human)) to ||The human||.
Page 5, line 16
Change ((rather inside)) to ||rather than inside||.
Page 5, line -8
Change ((displays)) to ||display||.
Page 6, line 12
Change ((player to appear)) to ||player appear||.
Page 6, line -5
Change ((synthetic player)) to ||the synthetic player||.
Page 7, line -13
Change ((started provide)) to ||started to provide||.
Page 7, line -5
Change ((is unique)) to ||is a unique||.
Page 8, line 7
Change ((the can)) to ||they can||.
Page 8, line 8
Change ((player)) to ||players||.
Page 8, line -1 -- page 9, line 1
Change ((For instance, Max Payne [...] are concluded)) to ||For instance, in Max Payne or Diablo II, the plot lines of the previous chapter are concluded at the transition point||.
Page 9, line 2
Change ((do not include)) to ||neither include||.
Page 9, line -6
Change ((seems)) to ||seem||.
Page 10, line 8
Change ((player learn)) to ||player can learn||.
Page 10, line 9
Change ((in easier and possible)) to ||in an easier and possibly||.
Page 10, line 15
Change ((the members)) to ||members||.
Page 10, line 17
Change ((as just)) to ||just a||.
Page 11, line -11
Change ((concentrates typical)) to ||concentrates on typical||.
Page 17, line 8
Change ((m = aq + r)) to ||m = aq + p||.
Page 24, Algorithm 2.3
In line 3, change ((n)) to ||n - 1||. In line 10, remove ((smallest)).
Page 37, Algorithm 2.12, line 1
Remove the superfluous ((H0,0)).
Chapter 2
Page 27, line 6
Change ((Section ??)) to ||Section 8.2||.
Page 34, Algorithm 2.9, INCREASE
In line 2, change (((p))) to ||(H, p)||.When the height is near to the maximum, the algorithm can overcompensate the correction. To prevent this rewrite line 1 ||j ← min{hmax - Hp, i}; Hp ← Hp + j||, and change ((i)) to ||j|| in line 4.
Chapter 3
Page 43, line 8
Change ((assigned with a ranking)) to ||assigned a ranking||.
Page 45, line -3
Remove ((also)).
Page 48, Algorithm 3.4, line 1
R should be initialized. Change ((m ← match(p, q))) to ||R ← P \ {p, q}; m ← match(p, q)||.
Page 49, Algorithm 3.5, preamble
The constant for the number of pyramid levels should be ||m = lg(n + 1)||.
Page 51, Figure 3.2, caption
Change ((players (squares))) to ||players (circles)|| and ((matches (circles))) to ||matches (squares)||.
Chapter 4
Page 66, lines 17-18
Change ((from second)) to ||from the second||.
Page 66, line -2
Change ((in two-player)) to ||in a two-player||.
Page 68, line 1 and 2
Change ((labelled to)) to ||labelled||.
Page 69, line -2
Change ((where the both)) to ||where both||.
Page 76, line -7
Change ((alpha-beta cannot prune)) to ||it possible that alpha-beta cannot prune||.
Page 81, Algorithm 4.5, preamble
Remove local definition ((boolean p...candidacy)). Add local definition ||value t for null-window test||.
Page 81, Algorithm 4.5, lines 6 and 7
Rewrite line 6 ||select w ∈ children(v); e ← -PRINCIPAL-VARIATION-SEARCH(w, -β, -α)||. In line 7, change ((children(v))) to ||children(v) \ {w}||.
Chapter 5
Page 86, line 7
Change ((gets)) to ||become||.
Page 91, Algorithm 5.1, lines 3 and 7
Remove lines 3 and 7.
Chapter 6
Page 113, line 12
Change ((be appended)) to ||appended||.
Page 123, line 11
Change ((If take)) to ||If we take||.
Page 127, Algorithm 6.1, line 13
Change ((})) to ||)||.
Chapter 7
Page 142, line 13
Change ((successors)) to ||successors and predecessors||.
Page 146
Throughout the example, change (({T, E})) to ||{A, E}|| and (({W, T, E})) to ||{A, W, E}||. Change the conclusions to ||Bel(A) = 1|| and ||Pl(A) = 1||.