Every blog post that took off on Hacker News, ranked by the votes of its best submission. 2,851 posts.
I recently came across Paul Heckbert's business card raytracer. For those that have never heard of it: It is a very famous challenge in the Computer Graphics field that started on May 4th, 1984 via a post on comp.graphics by Paul Heckbert ( More about this in his article " A Minimal Ray Tracer " from the book Graphics…
A playable disease simulation
How to rotate an image, and a need trick to rotate a bitmap an arbitrary amount in a simple paint package.
[Note: There is a followup to this post .] There has been a lot written over the past decade (and even longer) about problems associated with null hypothesis statistical testing (NHST) and p values. Personally, I have found most of these arguments unconvincing. However, one of t
Mathematics Professor Gilbert “Gil” Strang taught his last class to thousands after teaching calculus, analysis, and linear algebra for more than 60 years at MIT and online. He reflects on his life at the Institute and as an instructor with MIT OpenCourseWare.
On my Introduction to A* page I cover the basics of the A* graph search algorithm for finding shortest paths. Here’s an example from the town of Denerim in Dragon Age Origins. Try moving the start and goal to see A* in action:
We solve 20% of ARC-AGI-1 with no pretraining by minimizing the description length during inference time, with the only data involved being the target puzzle itself.
A complete guide to quantization: how LLMs store parameters as floats, why shrinking them to 4 or 8 bits barely hurts accuracy, and how to measure the tradeoff.
Inside every AI is a bigger AI, trying to get out
All original material on the geometry.org website is Copyright (C) 1999–2025, Alan U. Kennington.
This morning I had the pleasure to be a mathematical guest in my daughter’s third-grade class, full of inquisitive eight- and nine-year-old girls, and we had a wonderful interaction. Followin…
A data-driven exploration of how the Hacker News ranking algorithm works.
An interactive visualization to understand how neural networks work
Let's review the most important math topics used by game devs, reflect about math education, and discuss techniques that can be used to improve the way we learn new math topics.
If you, like me, frequently commute via public transit, you may be familiar with the following situation:
Math from Three to Seven: The Story of a Mathematical Circle for Preschoolers, Alexander Zvonkin (Moscow Center for Continuing Mathematical Education, 2007).
I wrote a little book about entropy; here’s the current draft: • What is Entropy? If you see typos and other mistakes, or have trouble understanding things, please let me know! An altern…
During some random discussion with my colleague today, I rediscovered an experiment I did quite some years ago: MP3 compression of image data. This is, feed raw 8-bit-per-pixel grayscale image data into an MP3 encoder, let it compress it, and decode the MP3 file again. After some conversion (the decoder will always…
" I think a lot of mathematics is really about how you understand things in your head. […]
Collaborative peer-to-peer applications sometimes need to operate on sequences of objects with a consistent order across all peers. For example, a peer-to-peer photo album application might need to sync the order in which photos appear in an album.
I decided to write an article about a thing that is second nature to embedded systems programmers – low level bit hacks. Bit hacks are ingenious little programming tricks that manipulate integers in a smart and efficient manner. Instead of performing operations (such as counting the number of 1 bits in an integer)…
In this course we explain how category theory—a branch of mathematics known for its ability to organize the key abstractions that structure much of the mathematical universe—has become useful for writing elegant and maintainable code. In particular, we'll use examples from the Haskell programming language to motivate…
The Millennium Prize Problems were unveiled by the Clay Mathematics Institute (CMI) at a meeting in Paris in 2000 to celebrate “The Universality of Mathematical Thought”. These problems encapsulate some of the most difficult challenges that mathematicians were grappling with at the turn of the millennium. CMI’s…
Craig Gidney's computer science blog
Sweep-and-prune is my go-to algorithm when I want to quickly implement collision detection for a game. I think it’s an awesome and elegant algorithm, so I wrote a post about it.
