uccser/cs-field-guide

## Other intractable problems

{panel type="teacher-note"}

# Under construction

More material on the many intractable problems that exist is yet to be written, but in the meantime, here are some alternatives to the TSP problem that can be used to explore intractability if you have students who can work on this independently.

{panel end}

There are thousands of problems like the TSP for which no tractable solution is known.
Extra sections will eventually be added here to introduce some of them, but in the meantime, if you are keen you might like to explore some of these problems:

- [Map and graph colouring](http://csunplugged.org/graph-colouring) (these can be reduced to a timetabling problem and vice versa, showing how NP-complete problems can relate to each other)
- [The knapsack problem](https://en.wikipedia.org/wiki/Knapsack_problem)
- [Hamiltonian paths](https://en.wikipedia.org/wiki/Hamiltonian_path) (no tractable solution for this is known, yet the very similar Eulerian path, which is often presented as the seven bridges problem, has an easy tractable solution)
- [Steiner trees](http://www.csunplugged.org/steiner-trees)
- [Dominating sets](http://www.csunplugged.org/dominating-sets)
- [Longest path](https://en.wikipedia.org/wiki/Longest_path) (this is interesting because finding the longest path is intractable, yet finding the shortest path is tractable - the shortest path is calculated when a GPS device works out the shortest route to a destination.
  Also, a Hamiltonian problem can be reduced easily to longest path, showing the concept of reduction when one NP-complete problem is used to solve another).
  [Here's a song about it!](https://www.youtube.com/watch?feature=player_embedded&v=a3ww0gwEszo)
- [The Battleship problem](https://en.wikipedia.org/wiki/Battleship_%28puzzle%29)