Hacker News new | past | comments | ask | show | jobs | submit login

Memoization is just caching so I'm not sure how that would make any difference here.



Different sets of moves can lead to the same state, so if you can cache that a given state will not lead to a solution you can stop exploring that branch when you encounter it again.


Is that 'dynamic programming' or is that just keeping a set of explored states?




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: