Chapter 4.1: Local Search

Contents

• Assignments:
  • The n-Queens Problem
  • The Traveling Salesman Problem
• Examples:
  • Apply Simple Hill Climbing to a Maze Problem
  • The n-Queens Problem - Speeding up the conflict calculation with JIT compiled code (numba).
  • Example code for the TSP

License

All code and documents in this repository is provided under Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License