Chuck Norris can solve the Towers of Hanoi in one move. 331 282 Copy WhatsApp Tweet Share Reddit Pin 54% approval (613 votes)
Chuck Norris solved the Travelling Salesman problem in O(1) time. Here's the pseudo-code: Break salesman into N pieces. Kick each piece to a different city.
A man once taunted Chuck Norris with a bag of Lay's potato chips, saying "Betcha can't eat just one!" Chuck Norris proceeded to eat the chips, the bag, and the man in one deft move.
If Chuck Norris were a calendar, every month would be named Chucktober, and every day he'd kick your ass.