Question: (a) Give the pseudo-code for a bi-directional breadth first search , and explain the data structures required for an optimal implementation. 4 marks (b) Pentominoes
- (a) Give the pseudo-code for a bi-directional breadth first search, and explain the data structures required for an optimal implementation.
4 marks
- (b) Pentominoes are connected shapes that are formed by five equal size squares that have at least one edge in common. There are 12 of these up to reflection and rotation. A well known puzzle, is given some starting arrangement of the twelve pentominoes, add the remaining pentominoes to completely fill a 10 by 6 grid, as in the picture.
Name an uninformed search algorithm to solve this problem, and justify your answer if terms of time and space complexity.
3 marks
- (c) Suppose we are using the A* algorithm to solve the pentominoes puzzle. Propose a heuristic for the algorithm and show that it is admissible and monotonic.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
