How this book is organized: A roadmap
Generating Fibonacci numbers with a stream
3 Constraint-satisfaction problems
Building a constraint-satisfaction problem framework
The Australian map-coloring problem
Working with Edge and UnweightedGraph
Revisiting breadth-first search (BFS)
Minimizing the cost of building the network
Finding the minimum spanning tree
Finding shortest paths in a weighted graph
Challenges for genetic algorithms
The k-means clustering algorithm
Clustering governors by age and longitude
Clustering Michael Jackson albums by length
K-means clustering problems and extensions
7 Fairly simple neural networks
Neural network problems and extensions
Testing minimax with tic-tac-toe
Improving minimax with alpha-beta pruning
Minimax improvements beyond alpha-beta pruning
The Traveling Salesman Problem