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

Hey, honest question here, is it impossible to brute force this and consider (almost) every possible move and get to a non possible to loose point? Given that the board is restricted to 15x15 and the fruits to 81... I'm not saying this is easy, I'm asking if the game AI has an upper limit so to say...



The instructions say you need to make a move in 10 seconds, but that's the only ceiling I can imagine for this approach.


Ohh, I missed that, that makes more sense now, thought ten seconds is quite a lot, you will very probably not be able to brute force every possibilities before every move. Thanks!


Search space = 4^(15x15) = 2.9 × 10^135

Impossible.




Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact

Search: