Python Programming - Computational Thinking
Budget: $12 – $30 SGD
Write python code & algorithm
First sectiont:
A 2D list represents a 2D board with cells of a Maze. Each cell may only be in one of five states: Entrance (3), Exit (2), Wall (1), Path (0) and Treasure (4). Given a 2D list of a Maze and the Entrance coordinates, you are required to write an algorithm
To exit the maze and return a result list containing coordinates of the path from entrance to exit.
Start at the Maze Entrance (3), find your way to the Maze Exit (2) by moving horizontally or vertically along the Maze Path (0) / Treasure (4) via 1 cell movement.
second section:
A 2D list represents a 2D board with cells of a Maze. Each cell may only be in one of five states: Entrance (3), Exit (2), Wall (1), Path (0) and Treasure (4). Given a 2D list of a Maze and the Entrance coordinates, you are required to write an algorithm
To get the treasure and exit the maze. Return the result as a list containing (1) list of coordinates of the path from entrance to treasure and to exit and (2) coordinate location of the treasure.
Start at the Maze Entrance (3), find your way to the Maze Exit (2) by moving horizontally or vertically along the Maze Path (0) / Treasure (4) via 1 cell movement.
contact me for more details.
need to be done within next 5 hours - only contact if you are available to do it.
First sectiont:
A 2D list represents a 2D board with cells of a Maze. Each cell may only be in one of five states: Entrance (3), Exit (2), Wall (1), Path (0) and Treasure (4). Given a 2D list of a Maze and the Entrance coordinates, you are required to write an algorithm
To exit the maze and return a result list containing coordinates of the path from entrance to exit.
Start at the Maze Entrance (3), find your way to the Maze Exit (2) by moving horizontally or vertically along the Maze Path (0) / Treasure (4) via 1 cell movement.
second section:
A 2D list represents a 2D board with cells of a Maze. Each cell may only be in one of five states: Entrance (3), Exit (2), Wall (1), Path (0) and Treasure (4). Given a 2D list of a Maze and the Entrance coordinates, you are required to write an algorithm
To get the treasure and exit the maze. Return the result as a list containing (1) list of coordinates of the path from entrance to treasure and to exit and (2) coordinate location of the treasure.
Start at the Maze Entrance (3), find your way to the Maze Exit (2) by moving horizontally or vertically along the Maze Path (0) / Treasure (4) via 1 cell movement.
contact me for more details.
need to be done within next 5 hours - only contact if you are available to do it.