Simple rules used in problem solving that do not guarantee a solution but offer a likely short-cut to it are called _____.
a. inductions
b. perceptual sets
c. algorithms
d. heuristics
I believe the answer is: D.heuristics Heuristics is a solution that would never provide optimum result, but would be considered as 'sufficient'. Example of heuristic: Spanking your kids unless they're get a good score. It might be working for a while, but the score isn't guaranteed to stay the same after the beating stop.
