{
"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,
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
- "version": "3.5.2+"
+ "version": "3.5.2"
}
},
"nbformat": 4,