Episode 11.22: How Q-learning overcomes the need to search to the end of every branch of a tree.

The problem with chess is that searching beyond a few moves ahead causes a combinatorial explosion: the number of possibilities overwhelms us. So how does Q-learning overcome this problem?