I really need help on this, I'm stuck and I know you have to create a matrix of random 1's and 0's, but I'm stuck. PLEASE HELP

Make a math model and the hash function implementation to automata system with a walking bomb and a walking robot: 1) The Robot, and the Bomb are running by autonousmly, accessing the board/worskspace control variables located/accessible inside the hash table;

2) The Robot and the Bomb walking steps should be synchronized as follow: for each two steps/squares walked by the Robot, Bomb will walk one square in the grid / hash table.

3) The Robot should walk around and avoid stepping on any square where a Bomb is randomly placed. The Bomb should not step on any GoldBar. The Robot can move one square at time; the Bomb moves one square walking around only after the Robot has moved two squares/steps in the grid / hash table.

4) Robot should keep walking around for as long as there is still a GoldBar to be found and collected in the workspace; if the Bomb catches the Robot, or there is no GoldBar left in the workspace, then the automatas reached there goal with two possible states: or .