The heuristic function (n) attempts to guide the search to quickly arrive at the solution. The objective of this study was to implement a heuristic search strategy A * to solve a real problem. It has the function of finding a solution to the problem using non-rigorous methods such as trial and error, rules of thumb, etc. The algorithm used to solve the problem is efficient. In addition, the results obtained on the console are as expected from the analysis, so there is assurance that the code is working correctly. This research can allow the copy function for modification of the data matrices and the creation of several matrices to cover all the data.

Algorithm, heuristics, classification, matrices, robot.