A developer has created a weak but functional chess engine using 84,688 regular expressions to execute a two-ply minimax search. This unconventional project demonstrates the extreme computational capabilities of regular expressions by using them to evaluate board states and execute game moves.