There's brute force involved, but it's not brute force by itself. It's like a chess engine, which yes, it checks thousands of positions, but only after filtering out hundreds of thousands of positions.
Are you involved in writing or maintaining this software? If so can you provide some more details on this “filtering”? Because I skimmed the source code [1] and it looks to me like it’s pure brute force building a database of lines and points up to a certain rank (number of operations required to create that line/point) and then searching through it.
No, you are right. The author even uses the expression "by pure brute force". I just supposed it would given that virrually every number a user would input is constructible with foldings.
Comments
There's brute force involved, but it's not brute force by itself. It's like a chess engine, which yes, it checks thousands of positions, but only after filtering out hundreds of thousands of positions.
Are you involved in writing or maintaining this software? If so can you provide some more details on this “filtering”? Because I skimmed the source code [1] and it looks to me like it’s pure brute force building a database of lines and points up to a certain rank (number of operations required to create that line/point) and then searching through it.
[1] https://github.com/MuTsunTsai/reference-finder-cpp/blob/main...
No, you are right. The author even uses the expression "by pure brute force". I just supposed it would given that virrually every number a user would input is constructible with foldings.