Polymathematics has solved the 3-smooching problem, but whether this solution can be generalized into an N-smooching solution is yet unknown.
Polymathematics has solved the 3-smooching problem, but whether this solution can be generalized into an N-smooching solution is yet unknown.
It would have to be thin crust. You wouldn't want a stretching bouthful on the way.
Square-cut would make it even easier, but you'd need 4.