1
$\begingroup$

Applying entertainment with computations is my main motivation in studying Computer Science, however, I'm still a neophyte to this field. While searching across the net, I came across this paper Classic Nintendo Games are (Computationally) Hard, indicating that Mario is an NP-Hard problem. Given by the proof of NP-hardness in the paper, I'm wondering, can we apply metaheuristic algorithms in solving the Mario Problem? If yes, I would be glad if you can provide an example and show how it works.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.