In this talk we will discuss the puzzle Blet. Its simple appearence hides some interesting mathematics involving the geometry of certain lattice paths in the plane and the group SL(2,R). It is also a nice illustration of a typical discrete minimization problem where greed is not the answer.