Typos

QRPuzzles.m

@@ -65,7 +65,7 @@ runs of black cells and (2) an optional 'given' partially complete state of the
 candidate solution, which is used as a given for a subsequent iteration, unless the candidate solution has stopped
 changing, in which case the search for a solution ends.
 
-When the search ends, a fully specified puzzle will have no unknowns. The same algorithim can be used therefore
+When the search ends, a fully specified puzzle will have no unknowns. The same algorithm can be used therefore
 to identify cells where knows need to be provided inorder to create a fully specified puzzle (see Generation).
 
 Each new candidate solution is generated by first filtering all possible rows allowed by the row clues against
@@ -74,7 +74,7 @@ to identify cells where knows need to be provided inorder to create a fully spec
 columns as a candidate solution.
 
 Nearly the time here is taken up by the initialization of poss; after that, the solution is fast.
-There is a possibly unnecessary refinement of sol using poss[[2]] if the preceeding poss[[1]] step has completed the
+There is a possibly unnecessary refinement of sol using poss[[2]] if the preceding poss[[1]] step has completed the
 puzzle; not worth checking.
 
 *)