So today I had a square paper with McDonalds coupons on it from which you had to cut out one coupon to use it. That got me wondering, how could I cut this square paper with coupons in least number of cuts by folding the paper over such that I cut every coupon out.
So here are the rules I made.
Assume there is a $NxN$ square made out of $1x1$ squares. What is the least number of cuts you have to make to cut every $1x1$ square "out" of the bigger $NxN$ square. You can fold the square in any way you like that is physically possible in the real world.
For clarity, in this picture the square paper is $3x3$ or $N=3$ and you want to cut out the 9 little squares out. If I wasn't clear enough, please ask me to clarify more.