TED-Ed: Can you solve the virus riddle? - Lisa Winer

In a lab scenario, a virus is accidentally released, and the challenge is to destroy it by activating self-destruct switches in a grid of rooms. The problem is related to the Hamiltonian path problem, which is complex and involves visiting each room exactly once. The solution involves using the entrance room as an exception to complete the task. The video concludes with a reflection on the experience.

What conclusion can be drawn about the possibility of a Hamiltonian path in a grid with an even number of rooms?

How does the color pattern of a checkerboard grid relate to the Hamiltonian path problem?

What is the exception that allows the protagonist to return to the entrance after activating a switch?