project euler problem 128

Hexagonal tile differences

This is not a so interesting problem. One just need to figure out which cell could have 3 prime-difference neighbors. Then the rest of the problem is simple and easy.