Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Assuming OP means they used beam search on the sub trees of possible moves, which yields some local minimum / maximum in the objective space. Especially useful here because of the sheer multitude of possible moves, and also RNG.

Beam search can be googled for useful results, beam solver can not.



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

Search: