diff --git a/src/main/java/edu/rpi/legup/puzzle/minesweeper/MinesweeperUtilities.java b/src/main/java/edu/rpi/legup/puzzle/minesweeper/MinesweeperUtilities.java
index f001c2626..c81f22798 100644
--- a/src/main/java/edu/rpi/legup/puzzle/minesweeper/MinesweeperUtilities.java
+++ b/src/main/java/edu/rpi/legup/puzzle/minesweeper/MinesweeperUtilities.java
@@ -321,8 +321,8 @@ public static boolean nonTouchingSharedIsEmpty(MinesweeperBoard board, Minesweep
         int numFar;
 
         // Goes through all possible positions that horizontally adjacent number cells
-        // could be in that could force the current cell to be a empty. If one possibility
-        // actually has the number cells that force the current cell to be a empty, return true
+        // could be in that could force the current cell to be empty. If one possibility
+        // actually has the number cells that force the current cell to be empty, return true
         for(int i = -1; i <= 1; i += 2) {
             for(int j = -1; j <= 1; j ++) {
                 if(x + (2 * i) >= 0 && x + (2 * i) < width
@@ -362,8 +362,8 @@ public static boolean nonTouchingSharedIsEmpty(MinesweeperBoard board, Minesweep
         }
 
         // Goes through all possible positions that vertically adjacent number cells
-        // could be in that could force the current cell to be a empty. If one possibility
-        // actually has the number cells that force the current cell to be a empty, return true
+        // could be in that could force the current cell to be empty. If one possibility
+        // actually has the number cells that force the current cell to beempty, return true
         for(int i = -1; i <= 1; i += 2){
             for (int j = -1; j <= 1; j++) {
                 if (x + j >= 0 && x + j < width
diff --git a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithEmptyDirectRule.java b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithEmptyDirectRule.java
index 2dd80a01b..96b50a0e7 100644
--- a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithEmptyDirectRule.java
+++ b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithEmptyDirectRule.java
@@ -12,7 +12,7 @@ public FinishWithEmptyDirectRule() {
         super(
                 "MINE-BASC-0002",
                 "Finish With Empty",
-                "The only way for the numbers around this cell to be satisfied is for this cell to not contain a mine",
+                "There exists a number around this cell that can only be satisfied if this cell is empty",
                 "edu/rpi/legup/images/minesweeper/direct/FinishWithEmpty.png");
     }
 
diff --git a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithMinesDirectRule.java b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithMinesDirectRule.java
index 4b4c6435a..9e3c5af70 100644
--- a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithMinesDirectRule.java
+++ b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/FinishWithMinesDirectRule.java
@@ -12,7 +12,7 @@ public FinishWithMinesDirectRule() {
         super(
                 "MINE-BASC-0001",
                 "Finish With Mines",
-                "The only way for the numbers around this cell to be satisfied is for this cell to contain a mine",
+                "There exists a number around this cell that can only be satisfied if this cell contains a mine",
                 "edu/rpi/legup/images/minesweeper/direct/FinishWithMine.png");
     }
 
diff --git a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/MineOrEmptyCaseRule.java b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/MineOrEmptyCaseRule.java
index 0ef272882..4724d2be2 100644
--- a/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/MineOrEmptyCaseRule.java
+++ b/src/main/java/edu/rpi/legup/puzzle/minesweeper/rules/MineOrEmptyCaseRule.java
@@ -17,7 +17,7 @@ public MineOrEmptyCaseRule() {
         super(
                 "MINE-CASE-0001",
                 "Mine or Empty",
-                "A cell can either be a mine or filled.",
+                "An unset cell can either be a mine or filled.",
                 "edu/rpi/legup/images/minesweeper/cases/MineOrEmpty.png");
     }