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.diegojavierfares.com/mega-save-KSUBI-4-X-4-TRAK-Mens-Apparel-great-choice/