That was me. The engine is deterministic so I wrote a beam solver for it. My score should've been 208 (pretty sure it could play forever; I capped the solver at a max time limit) but I messed up one of my moves (I was manually moving the pieces instead of submitting the final move list with curl).
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.
That was me. The engine is deterministic so I wrote a beam solver for it. My score should've been 208 (pretty sure it could play forever; I capped the solver at a max time limit) but I messed up one of my moves (I was manually moving the pieces instead of submitting the final move list with curl).
What is a beam solver?
Were you able to rig up the solver to the running game?
Curious what this looks like!
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.
It was a matter of time I suppose. Would love to see the solver!
Haha so clever love it! Must look into a beam solver
I would expect no less from Hacker News, good job.
Well done for scoring 2nd place. :)