Before revision:  When the path is restricted to have at most n-2 turns, we show that the approximate problem becomes NP-complete, and the exact problem becomes ETR-complete.
After revision:  We also show that decision variants of the square-cut problem are hard: we show that the approximate problem becomes NP-complete, and the exact problem becomes ETR-complete.