FR | EN
Quentin L. Meunier
Associate Professor in Computer Science at Sorbonne Université

Problem 1069

A L-addition consists in the following operation: we choose three squares forming a L (two squares share one of their sides, horizontal for one, vertical for the other, with a third square), then we add 1 to each of the numbers they contain.




For example, in the green grid above, a first L-addition can transform 10, 11 and 7 respectively to 11, 12 and 8. The goal is that all the squares contain the same number, called target number.






I haven't written a program for this problem.



  • 1. 16

  • 2. 18