Overview#
This project solves the Travelling Salesman Problem using top-down memoization and compact state encoding. It emphasizes algorithmic clarity and predictable performance behavior.
Highlights#
- Top-down DP with memo table reuse
- Bitmask representation for state compression
- Route reconstruction from computed states
- Idiomatic Scala implementation with clean entrypoints
Challenges & Learnings#
- Managing memory growth as city count increases
- Building readable bitmask logic and transitions
- Validating correctness with known benchmark instances
@l0stplains