Search methods have been instrumental in computing superhuman strategies for large-scale games [1,2,3]. However, existing search techniques are tabular and can therefore have trouble searching far into the future. This is particularly a problem in games with high stochasticity and/or imperfect information. For example, existing search techniques in Hanabi, which is considered an interesting research problem by the AI community [4], are only able to search one move ahead. Even searching two moves ahead is considered intractable for existing techniques. Since real-world situations are...