Get the latest tech news
No reachable chess position with more than 218 moves
Stop searching, we had it right for 60 years.
While searching through all possible piece configurations, we would ideally like to have some provably correct way of telling whether we can still reach 218 moves, so we can stop trying and save ourselves an astronomically large amount of work. Checking more positions to make things less slow To reduce the size of the model, I bent some chess rules, simplifying the search space: I don't think that integer linear programming is a suitable approach for all of them, one likely has to develop a custom algorithm for computing good upper bounds, based on creative mathematical insights.
Or read this on Hacker News
