Computers learning Tic-Tac-Toe Pt. 1: Tabular Q-learning
Learn how to make computers play Tic-Tac-Toe using the minimax and Q-learning algorithms
Recent Posts
When Fourier fails: Gram-Fourier extensions
One extension to rule them all. How to efficiently reuse accurate SVD extensions.
When Fourier fails: SVDs and Fourier extensions of the third kind
Learn about the magic of high-precision extensions using SVDs.
When Fourier fails: Inverse Polynomial Reconstruction
Learn more how to change to an exponentially accurate function basis.
When Fourier fails: Mollifiers
Learn more about mollifiers to obtain periodic extensions.