From 705a2e921b123b910754945f0d73213eb9d39499 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Thu, 20 Apr 2017 22:58:12 +0300
Subject: [PATCH] Improve grammar

---
 chapter19.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/chapter19.tex b/chapter19.tex
index 6b00034..29383bb 100644
--- a/chapter19.tex
+++ b/chapter19.tex
@@ -588,9 +588,9 @@ A \key{knight's tour} is a sequence of moves
 of a knight on an $n \times n$ chessboard
 following the rules of chess such that the knight
 visits each square exactly once.
-The tour is \key{closed} if the knight finally
+A tour is \emph{closed} if the knight finally
 returns to the starting square and
-otherwise the tour is \key{open}.
+otherwise it is \emph{open}.
 
 For example, here is an open knight's tour on a $5 \times 5$ board: