Correct Path Finding Coding Challenge

Posted: August 26th, 2021

Student’s Name

Professor’s Name

Course

Date

Correct Path Finding Coding Challenge

The selected coding game is the “Correct Pathfinding,” available on https://www.codingame.com/. The challenge involves developing an algorithm that can help plot the shortest route existing between one point and another. Typically, the algorithms developed are utilized in searching for a graph from one vertex to the other through the exploitation of adjacent nodes. The process continues until the final destination is attained. The aim is to seek a less costly route. Besides the pathfinding method, other methods exist, which can be useful in finding the correct and highly efficient route, although they are time-consuming. In this case, the pathfinding algorithm is the most less time-consuming method, which tends to explore and navigate the graph until an efficient route is achieved. Analogically explained, consider a person moving across in a room; instead,  searching the shortest route, the person randomly picks a direction through which he only deviates before and obstacle. In the case of correct pathfinding, the person will evaluate for the shortest route, thus cutting across the room with less time.

The Coding Challenge

The data chosen for the challenge are numbers and boxes, which are retrieved from the program repository. The python program language is utilized in implementing the challenge. The challenge begins by first selecting a preferred repository and verifying the setup. On a tableau that appears, the challenge requires that one utilizes the numbers within the boxes to navigate from one point to the other. The pathfinding algorithm is selected and used in executing the challenge. Hence, the most significant factor was selecting the appropriate algorithm. Also, the biggest hurdle to completing the challenge was mixing techniques that can effectively help measure the appropriate distance between the points.