<title>Classic Computer Science Problems in JavaScript</title>

<meta charset="utf-8" />

<h1>Classic Computer Science Problems in JavaScript</h1>

<h2>Chapter 1: Small Problems</h2>

<li><a href="chapter1/fib1.html">Fibonacci Sequence (recursive with missing base case, will throw exception)</a></li>

<li><a href="chapter1/fib2.html">Finonacci Sequence (recursive)</a></li>

<li><a href="chapter1/fib3.html">Fibonacci Sequence (recursive with memoization)</a></li>

<li><a href="chapter1/fib4.html">Fibonacci Sequence (iterative)</a></li>

<li><a href="chapter1/fib5.html">Fibonacci Sequence (with generator)</a></li>

<li><a href="chapter1/trivial_compression.html">Trivial Compression</a></li>

<li><a href="chapter1/unbreakable_encryption.html">Unbreakable Encryption</a></li>

<li><a href="chapter1/calculating_pi.html">Calculating Pi</a></li>

<li><a href="chapter1/hanoi.html">Towers of Hanoi</a></li>

<h2>Chapter 2: Search Problems</h2>

<li><a href="chapter2/dna_search.html">DNA Search</a></li>

<li><a href="chapter2/generic_search_test.html">Generic Search Feature Test</a></li>

<li><a href="chapter2/maze.html">Maze Solving</a></li>

<li><a href="chapter2/missionaries.html">Missionaries and Cannibals</a></li>

<h2>Chapter 3: Constraint-satisfaction Problems</h2>

<li><a href="chapter3/map_coloring.html">The Australian Map-coloring Problem</a></li>

<li><a href="chapter3/queens.html">The Eight Queens Problem</a></li>

<li><a href="chapter3/word_search.html">Word Search</a></li>

<li><a href="chapter3/send_more_money.html">SEND+MORE=MONEY</a></li>

<h2>Chapter 4: Graph Problems</h2>

<li><a href="chapter4/graph_test.html">Graph (with shortest path)</a></li>

<li><a href="chapter4/weighted_graph_test.html">Weighted Graph</a></li>

<li><a href="chapter4/mst_test.html">Minimum Spanning Tree</a></li>

<li><a href="chapter4/dijkstra_test.html">Dijkstra's Algorithm (shortest path in a weighted graph)</a></li>

<h2>Chapter 5: Genetic Algprithms</h2>

<li><a href="chapter5/simple_equation.html">Simple Equation</a></li>

<li><a href="chapter5/list_compression.html">List Compression</a></li>

<li><a href="chapter5/send_more_money2.html">SEND+MORE=MONEY Revisited</a></li>

<h2>Chapter 6: kMeans Clustering</h2>

<li><a href="chapter6/kmeans_test.html">Trivial Example</a></li>

<li><a href="chapter6/governors.html">Governors</a></li>

<li><a href="chapter6/mj.html">Michael Jackson Albums</a></li>

<h2>Chapter 7: Fairly Simple Neural Networks</h2>

<li><a href="chapter7/iris_test.html">Iris Classification</a></li>

<li><a href="chapter7/wine_test.html">Wine Classification</a></li>

<h2>Chapter 8: Adversarial Search</h2>

<li><a href="chapter8/tictactoe_ai_web.html">Tic Tac Toe</a></li>

<li><a href="chapter8/connectfour_ai_web.html">Connect Four</a></li>

<h2>Chapter 9: Miscellaneous Problems</h2>

<li><a href="chapter9/knapsack.html">The Knapsack Problem</a></li>

<li><a href="chapter9/tsp.html">The Traveling Salesman Problem</a></li>

<li><a href="chapter9/phone_number_mnemonics_web.html">Phone Number Mnemonics</a></li>