Monte Carlo Tree Search
Monte Carlo Tree Search is a robust algorithm used for decision making in game playing and reinforcement learning. It is a heuristic search algorithm that combines the best aspects of tree search and Monte Carlo simulation. MCTS is particularly useful...

Pi from String Theory Amplitudes
From the paper by Arnab Priya Saha and Aninda Sinha. A new series for $\pi$ and its convergence.
$$

A Rapid Tutorial on Unsloth
Unsloth is a library for fast and efficient fine-tuning of large language models. It is built on top of the Hugging Face Transformers library and can be used to fine-tune models on a variety of tasks. In this case we'll train a Llama 3.1 model to do...

BFO, Or How to Describe Everything
The Basic Formal Ontology is an upper ontology that can describe a broad swatch of human knowledge. It's a cornerstone for logic programmers and those creating comprehensive knowledge graphs which cover multiple domains....