@@ -457,7 +457,7 @@ def h(self, node):
457
457
458
458
class NQueensProblem (Problem ):
459
459
"""The problem of placing N queens on an NxN board with none attacking
460
- each other. A state is represented as an N-element array, where the
460
+ each other. A state is represented as an N-element array, where
461
461
a value of r in the c-th entry means there is a queen at column c,
462
462
row r, and a value of None means that the c-th column has not been
463
463
filled in yet. We fill in columns left to right."""
@@ -503,7 +503,7 @@ def goal_test(self, state):
503
503
504
504
#______________________________________________________________________________
505
505
## Inverse Boggle: Search for a high-scoring Boggle board. A good domain for
506
- ## iterative-repair and related search tehniques , as suggested by Justin Boyan.
506
+ ## iterative-repair and related search techniques , as suggested by Justin Boyan.
507
507
508
508
ALPHABET = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
509
509
@@ -698,7 +698,7 @@ def __init__(self, problem):
698
698
699
699
def successor (self , state ):
700
700
"Return a list of (action, state) pairs reachable from this state."
701
- result = self .problem .successor (state )
701
+ result = self .problem .successor (state )
702
702
self .succs += 1 ; self .states += len (result )
703
703
return result
704
704
0 commit comments