X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;ds=sidebyside;f=problem-ideas.ipynb;h=137892dba7583762b106ea3cbeacb8ebcffd53e4;hb=7feed95175973490721236795cc7895e252965e2;hp=66012c785aa37bdd8d1afe596ce3f08e474f8636;hpb=d7db6acc4c4d5f065da2e95a313e376310a990e0;p=ou-summer-of-code-2017.git

diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb
index 66012c7..137892d 100644
--- a/problem-ideas.ipynb
+++ b/problem-ideas.ipynb
@@ -18,7 +18,7 @@
     "1. [Ticket prices](01-ticket-prices)\n",
     "2. [Lift instructions](02-lifts)\n",
     "3. [Door codes](03-door-codes)\n",
-    "4. [Ghost leg, follow and pack](04-08-amidakuji)\n",
+    "4. [Ghost leg, follow and pack](04-amidakuji)\n",
     "5. [Display board](05-display-board)\n",
     "6. [Tour shapes](06-tour-shapes)\n",
     "7. [Virtual machine](07-interpreter)\n",
@@ -257,9 +257,15 @@
     "# More problems:\n",
     "* [Advent of Code 2015](http://adventofcode.com/2015)\n",
     "* [Advent of Code 2016](http://adventofcode.com/2016)\n",
-    "* https://books.google.co.uk/books?id=85NsAHJjTJ0C&pg=PA390&lpg=PA390&dq=phone+number+problem+programming+names&source=bl&ots=c7oC9JvpZz&sig=aNnW6t_nmGK7SyAKchK0MaxqbkA&hl=en&sa=X&ved=0ahUKEwjnzcbbgs7RAhWKKcAKHQiFCDAQ6AEIJDAC#v=onepage&q=phone%20number%20problem%20programming%20names&f=false\n",
-    "* https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/\n",
-    "* https://www.reddit.com/r/dailyprogrammer/"
+    "* [Programming and Problem Solving with C++: Brief Edition](https://books.google.co.uk/books?id=85NsAHJjTJ0C&pg=PA390&lpg=PA390&dq=phone+number+problem+programming+names&source=bl&ots=c7oC9JvpZz&sig=aNnW6t_nmGK7SyAKchK0MaxqbkA&hl=en&sa=X&ved=0ahUKEwjnzcbbgs7RAhWKKcAKHQiFCDAQ6AEIJDAC#v=onepage&q=phone%20number%20problem%20programming%20names&f=false)\n",
+    "* https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/ , specifically the overlapping presentaitons problem from [2017 problems](https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/problems/Problems2017.pdf)\n",
+    "* https://www.reddit.com/r/dailyprogrammer/\n",
+    "\n",
+    "* N-rooks problem from http://www.olympiad.org.uk/images/bio2012-poster-v.jpg\n",
+    "\n",
+    "* \"How tweet it is\" from [2014 APL programming language competition](http://www.dyalog.com/uploads/files/student_competition/2014_problems_phase1.pdf) (remove interior vowels from words)\n",
+    "\n",
+    "* More ghost leg: simplify a network by finding whole permuation, then splitting it down into transpositions. Look at theory of permutations for details.\n"
    ]
   },
   {
@@ -310,7 +316,7 @@
     "1. [Ticket prices](01-ticket-prices): Ruby x\n",
     "2. [Lift instructions](02-lifts): Brainfuck x\n",
     "3. [Door codes](03-door-codes): Dart x\n",
-    "4. [Ghost leg, follow and pack](04-08-amidakuji): Clojure\n",
+    "4. [Ghost leg, follow and pack](04-amidakuji): Clojure\n",
     "5. [Display board](05-display-board): JavaScript/Node.js\n",
     "6. [Tour shapes](06-tour-shapes): Lua\n",
     "7. [Virtual machine](07-interpreter): Haskell (Advent 16 day 23)\n",