Add results document and BAWIM paper citation (arXiv:2607.02112).
Key findings:
- Oscillating bath solver doesn't outperform greedy/SA on tested problems
- Sudoku: backtracking is 1000× faster and exact
- MAX-CUT/NPP: SA marginally better at scale, bath shows no advantage
- Engine useful for hardware parameter exploration, not solver quality
Conclusion: approach not competitive for Sudoku solving.
