If we're going to disregard the rules that only exist to force every game to end in a reasonable timeframe, I'd love to see the collective world's computing power get stuck simulating a scenario in which both players move a knight out and back ad infinitum. As in, 1.Nf3 Nf6 2.Ng1 Ng8....
This is not some original Star Trek episode where the computer ends up exploding because you asked it "what is love?". It's incredibly easy to identify infinite repetitions, mark them as draws, and then proceed onwards.
#3739
Here is a rare game where the 50-moves rule was invoked
https://www.chessgames.com/perl/chessgame?gid=1710666