Show HN: Solving Rush Hour, the 6x6 Sliding Block Puzzle
Rush Hour is a 6x6 sliding block puzzle invented by Nob Yoshigahara in the 1970s. It was first sold in the United States in 1996.
The latest blog posts to take off on Hacker News. 2,391 posts.
Rush Hour is a 6x6 sliding block puzzle invented by Nob Yoshigahara in the 1970s. It was first sold in the United States in 1996.
This post is adapted from this research paper that you can read/cite for more info. It analyzes and visualizes 100 cities around the world.
John D. Cook, Greg Egan, Dan Piponi and I had a fun mathematical adventure on Twitter. It started when John Cook wrote a program to compute the probability distribution of distances $latex |xy R…
In science fiction, it is pretty standard fare to introduce some form of faster-than-light communication or travel. After all, space is big, and you can't write your swashbuckling Hornblower-in-space novel if you have to wait for a generation ship to crawl painfully slowly between the nearest stars,
Using K-means clustering on writing style to classify disputed Federalist Papers authorship.
Douglas Hofstadter's book Gödel, Escher, Bach: An Eternal Golden Braid is a classic text that's had a strong influence on countle...
Deep neural networks have been shown to be vulnerable to the adversarial example phenomenon: all models tested so far can have their classifications dramatically altered by small image perturbations . The following predictions were for instance made by a state-of-the-art network trained to recognize celebrities :
Sabine Hossenfelder’s new book Lost in Math should be starting to appear in bookstores around now. It’s very good and you should get a copy. I hope that the book will receive a lot of a…
Most of us last saw calculus in school, but derivatives are a critical part of machine learning, particularly deep neural networks, which are trained by optimizing a loss function. This article is an attempt to explain all the matrix calculus you need in order to understand the training of deep neural networks. We…
Generalized data structure synthesis Loncaric et al., ICSE’18 Many systems have a few key data structures at their heart. Finding correct and efficient implementations for these data structur…
Riffling from factory order to complete randomness.
I recently posted a blog post about a new hash table, and whenever I do something like that, I learn at least one new thing from my comments. In my last comment section Rich Geldreich talks about h…
In the early days of computing, 1 + 1 didn’t always equal 10
We are clearly not in a steady-state situation. Is this a bubble or a revolution? The answer surely includes a bit of revolution—the fields of vision and speech recognition have been turned over by great empirical successes created by deep neural architectures and more generally machine learning has found plentiful…
Hi, I wrote my new favorite hash table. This came about because last year I wrote the fastest hash table (I still make that claim) and this year one of the organizers of the C++Now conference asked…
This post is actually about artificial intelligence, and argues a position that many AI researchers will disagree with. Specifically, it arg...
(This was originally a sponsor talk given at PyCon 2018. Unfortunately there is no video.)
Early this year a software engineer, Shaun Gilchrist, reached out to me after reading a blog post of mine from many years ago, about my informal search for hidden patterns in the prime numbers. The Ulam Spiral revealed non-random patterns, but they didn’t quite match up. Both Shaun and I had long felt there was […]
Written for and first published in the Financial Times on 13 April 2018. One way to understand China is to look at the statistics. Real income per person has increased nearly tenfold since 1990. Si…
In 1949, in a festschrift devoted to Einstein , Kurt Gödel published a very short but profound paper titled “A Remark About the Relati...
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)…