X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=wordsearch%2Fwordsearch-solving.ipynb;h=b2c6c7ed6f748dc9ea3b452a4e9ec89a742f5f7f;hb=d86fa55df646b2374b032f3cc435cd4d8ddabf39;hp=89b8637ce637fccf631e10e0290635aa4b1dec40;hpb=4be776e6aef6b347a2ee84820f5e658e517cf43a;p=ou-summer-of-code-2017.git

diff --git a/wordsearch/wordsearch-solving.ipynb b/wordsearch/wordsearch-solving.ipynb
index 89b8637..b2c6c7e 100644
--- a/wordsearch/wordsearch-solving.ipynb
+++ b/wordsearch/wordsearch-solving.ipynb
@@ -1,5 +1,24 @@
 {
  "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Wordsearch\n",
+    "Given a text file, consisting of three parts (a grid size, a grid, and a list of words), find:\n",
+    "* the words present in the grid, \n",
+    "* the longest word present in the grid, \n",
+    "* the number of words not present in the grid, \n",
+    "* the longest word not present that can be formed from the leftover letters\n",
+    "\n",
+    "The only words that need be considered are the ones given in the list in the puzzle input.\n",
+    "\n",
+    "The puzzle consists of:\n",
+    "1. A line consisting of _w_`x`_h_, where _w_ and _h_ are integers giving the width and height of the grid.\n",
+    "2. The grid itself, consisting of _h_ lines each of _w_ letters.\n",
+    "3. A list of words, one word per line, of arbitrary length. "
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": 13,
@@ -1108,7 +1127,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.5.2+"
+   "version": "3.5.2"
   }
  },
  "nbformat": 4,