The Grand Chess Tree is a distributed volunteer computing system that counts how many possible move sequences exist up to a given depth in a game of chess. Since chess is a branching game—each move creates new possibilities. At depth 1, White has 20 moves. At depth 2, there are 400 possible positions. By depth 3, it’s 8,902. Then 187K, 4.8M, 3.2B…
Currently searching at a rate of around 50 billion positions a second!
If you're interested to be part of the project then come join us
Techfolk is a small project of mine showcasing some of the most prominent figures in the developer community. If you want more from your social feeds check them out!
Recently I needed an uptime monitor to periodically check the availability of my website. Unfortunately I couldn't find any free / simple / flexible solutions, so I came up with a nice way to use github workflows / playwright to ensure my web app is always up!
A collection of AI generated creative coding prompts & images to be used as a source of inspiration for developers interested in visual creative coding.
Currently searching at a rate of around 50 billion positions a second!
If you're interested to be part of the project then come join us
reply