When your friend asks you to "just code a simple chess game," and you realize you need to handle every possible board state individually. That's 2.6 million lines of if-else statements because who needs algorithms when you can hardcode each move?
The beautiful part is that technically it's an O(1) solution! Chess engines hate this one weird trick - just write out every possible game state and skip all that fancy minimax algorithm nonsense.
Bonus: your git commits will make it look like you're the most productive developer in history. "Added support for knight moves - 400,000 lines changed."