We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The problem states "Every timestep, each zombie RANDOMLY chooses one of its neighboring junctions and walks towards it.", so, how can the solution be always the same?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Zombie March***
You are viewing a single comment's thread. Return to all comments →
The problem states "Every timestep, each zombie RANDOMLY chooses one of its neighboring junctions and walks towards it.", so, how can the solution be always the same?