Merge pull request #883 from sshine/update-exercise-readmes

connect, isbn-verifier, minesweeper, robot-name: Update exercise readmes

Author: sshine

exercises/connect/README.md

@@ -5,15 +5,16 @@ Compute the result for a game of Hex / Polygon.
 The abstract boardgame known as
 [Hex](https://en.wikipedia.org/wiki/Hex_%28board_game%29) / Polygon /
 CON-TAC-TIX is quite simple in rules, though complex in practice. Two players
-place stones on a rhombus with hexagonal fields. The player to connect his/her
-stones to the opposite side first wins. The four sides of the rhombus are
+place stones on a parallelogram with hexagonal fields. The player to connect his/her
+stones to the opposite side first wins. The four sides of the parallelogram are
 divided between the two players (i.e. one player gets assigned a side and the
 side directly opposite it and the other player gets assigned the two other
 sides).
 
 Your goal is to build a program that given a simple representation of a board
 computes the winner (or lack thereof). Note that all games need not be "fair".
-(For example, players may have mismatched piece counts.)
+(For example, players may have mismatched piece counts or the game's board might
+have a different width and height.)
 
 The boards look like this:
 

exercises/isbn-verifier/README.md

@@ -41,6 +41,7 @@ Now, it's even trickier since the check digit of an ISBN-10 may be 'X' (represen
 
 * Generate valid ISBN, maybe even from a given starting ISBN.
 
+
 ## Getting Started
 
 Please refer to the [installation](https://exercism.io/tracks/haskell/installation)

exercises/minesweeper/README.md

@@ -1,30 +1,40 @@
 # Minesweeper
 
-Add the numbers to a minesweeper board.
+Add the mine counts to a completed Minesweeper board.
 
 Minesweeper is a popular game where the user has to find the mines using
 numeric hints that indicate how many mines are directly adjacent
 (horizontally, vertically, diagonally) to a square.
 
 In this exercise you have to create some code that counts the number of
-mines adjacent to a square and transforms boards like this (where `*`
-indicates a mine):
-
-    +-----+
-    | * * |
-    |  *  |
-    |  *  |
-    |     |
-    +-----+
-
-into this:
-
-    +-----+
-    |1*3*1|
-    |13*31|
-    | 2*2 |
-    | 111 |
-    +-----+
+mines adjacent to a given empty square and replaces that square with the
+count.
+
+The board is a rectangle composed of blank space (' ') characters. A mine 
+is represented by an asterisk ('\*') character.
+
+If a given space has no adjacent mines at all, leave that square blank.
+
+## Examples
+
+For example you may receive a 5 x 4 board like this (empty spaces are
+represented here with the '·' character for display on screen):
+
+```
+·*·*·
+··*··
+··*··
+·····
+```
+
+And your code will transform it into this:
+
+```
+1*3*1
+13*31
+·2*2·
+·111·
+```
 
 
 ## Getting Started

exercises/robot-name/README.md

@@ -2,17 +2,17 @@
 
 Manage robot factory settings.
 
-When robots come off the factory floor, they have no name.
+When a robot comes off the factory floor, it has no name.
 
-The first time you boot them up, a random name is generated in the format
+The first time you turn on a robot, a random name is generated in the format
 of two uppercase letters followed by three digits, such as RX837 or BC811.
 
 Every once in a while we need to reset a robot to its factory settings,
-which means that their name gets wiped. The next time you ask, it will
+which means that its name gets wiped. The next time you ask, that robot will
 respond with a new random name.
 
 The names must be random: they should not follow a predictable sequence.
-Random names means a risk of collisions. Your solution must ensure that
+Using random names means a risk of collisions. Your solution must ensure that
 every existing robot has a unique name.
 
 ## Hints