The longest (s. t)-path problem on supergrid graphs is known to be NP-complete. However. the complexity of this problem on supergrid graphs with or without holes is still unknown. https://www.chiggate.com/five-finger-death-punch-a-decade-of-destruction-vol-1-cd-supply/