Finding the Craziest Games in Chess with a bit of Coding!

Hi lads! First post here

Recently I put myself on the quest to find the craziest Chess games, so I spent a couple weeks writing a Python program to estimate the "craziness" of any given game using a bunch of different heuristics: sacrificed pieces, underpromotions, the King's proximity to the centre, long king walks in the opening etc. Different amounts of points are given to the game depending on how many of these things they have, and how many times they occur. The exact number of points I chose was kind of arbitrary, since it's just based off how relatively significant I think each heuristic is.

Nonetheless, the next part of my plan was to go through millions of Chess games from the database (both human and TCEC engine games in this case), and then sort them all by their craziness scores. It took over 3 days of continuous processing, but in the end I got to look through the games with the highest scores! I've attached some of them here:

KomodoDragon 2814.00 vs ScorpioNN 3.0.15

Pengxiang Zhang vs Ruslan Irzhanov

For those who are interested more in how the algorithm works / how I did it, I posted a full video to YouTube with visualisations of the algorithms & quick recaps of the games! I've linked the databases I used and the highlighted games in the description.

https://www.youtube.com/watch?v=FaOJNknjako

Hope this was interesting to some of you 💙 Many thanks