Question: What time of game is Aberrant which is also a type that Onyx Path Publishing produces?
Sentence (from "Longest path problem"): In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard, meaning that it cannot be solved in polynomial time for arbitrary graphs unless P = NP.
Relevant evidence: No