Four colour chess

Actually this post is not about 4 player chess, or multi coloured chess boards, but more about an historical link between the Four Color Theorem and chess. The Four Color Theorem states that you only need 4 colours to colour a map so that no region with a shared boundary (not corner) has the same colour. It is one of those maths problems which are easy to state, kind of simple to test, but difficult to prove.
One of the earliest (erroneous) proofs was given by Alfred Kempe, who was a mathematician and lawyer. He was also a pretty strong chess player, capable of pulling off some brilliant combinations. I came across a very good example where a slight slip by his opponent allowed a nice queen sacrifice, which led to the black king being caught in a mating net. Both perfectly sound, and delightfully 19th century.

Kempe,Alfred - S,G [C60]
Casual

1. e4 e5 2. Nf3 Nc6 3. Bb5 Nge7 4. d4 Nxd4 5. Nxd4 exd4 6. Qxd4 c6 7. Bd3 d6 8. O-O Ng6 9. f4 f6 10. Qf2 Be7 11. Be3 c5 12. Qf3 O-O 13. Bc4+ Kh8 14. Qh5 Bd7 15. Rf3 Be8 16. Qxh7+ Kxh7 17. Rh3+ Nh4 18. Rxh4+ Bh5 19. Rxh5+ Kg6 20. f5+ Kxh5 21. Be2+ Kh4 22. Nd2 Qe8 1-0