Search papers, labs, and topics across Lattice.
Université de Lorraine, Inria, LORIA
1
0
1
Tree search might be computational overkill in self-play: a minimal Approximate Value Iteration baseline learns more accurate value functions than AlphaZero while matching competitive play with just one-step lookahead.