Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.11469 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915689705504768 |
|---|---|
| author | Ramanathan, Pranav Prellberg, Thomas Lewis, Matthew Joshi, Prathamesh Dinesh Dandekar, Raj Abhijit Dandekar, Rajat Panat, Sreedath |
| author_facet | Ramanathan, Pranav Prellberg, Thomas Lewis, Matthew Joshi, Prathamesh Dinesh Dandekar, Raj Abhijit Dandekar, Rajat Panat, Sreedath |
| contents | The No-Three-In-Line problem asks for the maximum number of points that can be placed on an n by n grid with no three collinear, representing a famous problem in combinatorial geometry. While classical methods like Integer Linear Programming (ILP) guarantee optimal solutions, they face exponential scaling with grid size, and recent advances in machine learning offer promising alternatives for pattern-based approximation. This paper presents the first systematic comparison of classical optimization and AI approaches to this problem, evaluating their performance against traditional algorithms. We apply PatternBoost transformer learning and reinforcement learning (PPO) to this problem for the first time, comparing them against ILP. ILP achieves provably optimal solutions up to 19 by 19 grids, while PatternBoost matches optimal performance up to 14 by 14 grids with 96% test loss reduction. PPO achieves perfect solutions on 10 by 10 grids but fails at 11 by 11 grids, where constraint violations prevent valid configurations. These results demonstrate that classical optimization remains essential for exact solutions while AI methods offer competitive performance on smaller instances, with hybrid approaches presenting the most promising direction for scaling to larger problem sizes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_11469 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Three methods, one problem: Classical and AI approaches to no-three-in-line Ramanathan, Pranav Prellberg, Thomas Lewis, Matthew Joshi, Prathamesh Dinesh Dandekar, Raj Abhijit Dandekar, Rajat Panat, Sreedath Artificial Intelligence The No-Three-In-Line problem asks for the maximum number of points that can be placed on an n by n grid with no three collinear, representing a famous problem in combinatorial geometry. While classical methods like Integer Linear Programming (ILP) guarantee optimal solutions, they face exponential scaling with grid size, and recent advances in machine learning offer promising alternatives for pattern-based approximation. This paper presents the first systematic comparison of classical optimization and AI approaches to this problem, evaluating their performance against traditional algorithms. We apply PatternBoost transformer learning and reinforcement learning (PPO) to this problem for the first time, comparing them against ILP. ILP achieves provably optimal solutions up to 19 by 19 grids, while PatternBoost matches optimal performance up to 14 by 14 grids with 96% test loss reduction. PPO achieves perfect solutions on 10 by 10 grids but fails at 11 by 11 grids, where constraint violations prevent valid configurations. These results demonstrate that classical optimization remains essential for exact solutions while AI methods offer competitive performance on smaller instances, with hybrid approaches presenting the most promising direction for scaling to larger problem sizes. |
| title | Three methods, one problem: Classical and AI approaches to no-three-in-line |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2512.11469 |