Unity3D Task

Assumptions Map with dimensions of n*n, made of squares, n – can be changed by player In control panel. Obstacles on map, m – number of obstacles, obstacles in random places, obstacles with dimension of 1*1, 2*1, 1*2, 2*2. Randomly set start point and end point, on the fields that’s not obstacles. Cost of passing every square is the same. You can pass only through edges, passing diagonally is not allowed. (movement only left, right, up, down) Map can be saved, loaded. You can generate map with random obstacles, start point and end point Code written in C#, game should have GUI allowing convenient usage. Goal You must find (calculate) path from start to end point. Path must be shortest possible. If there’s no path (path is impossible to generate/calculate) you must return proper message (statement). You must implement finding of closest path (pathfinding) with two chosen algorithms. Project should be split on logical layers and modules – very important in test rating. Usage of app Player can start (run) map generator Player can save and load map Player can choose the map size, but not less than 10*10 squares. Player can pick pathfinding algorithm. Player can start pathfinding and showing the path