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.roneverhart.com/Western-Digital-Ultrastar-DC-HC570-WUH722222ALE6L4-0F48155-22TB-7-2K-RPM-SATA-6Gb-s-512e-SE-3-5in-Refurbished-HDD/