Heuristic Method (n.) The heuristic method is a method of problem solving, learning or discovery of reaching a sufficient immediate goal through practical methodology, but not a guaranteed optimal or perfect goal. It can be used as a sort of shortcut in a decision making process. Where finding an optimal solution is impossible or impractical with the heuristic methods, it is used to to speed up the process of finding a satisfactory solution. There are various forms of the heuristic method: educated guess, rule of thumb, working backwards, common sense, etc. Knowing these can be beneficial for problem solving in various situations in multiple fields on studies. Heuristics is done using applicable data that is readily available to dictate problem solving in both human beings and machines. Negroponte talks about the implementation of the heuristic method in the development and growth of the artificial intelligence. He thinks in the evolutionary machine (AI), the heuristic method has to be implemented to yield results in a timely manner. 1 It allows for the evolutionary machine to lend itself to personalization via the input of one designer or possibly many. 1 The heuristic method is mainly used in the beginning when the robot is “learning”, but reapplied constantly to continue its evolution.