Semantic based classification of search enhancements

Alresearch hasdeveloped numerous methods tosolve state space problems. During therecent times, onesuch strategy, Search Enhancements hasperformed apivotal roleinsolving complex realworldproblems. Many different properties andtaxonomies forthesesearch enhancements appear intheliterature. Thisworkpresents a new parameter fortheclassification of search enhancements withtheintent toaddanewdimension to theprocess ofcreating newenhancements aswellasto develop a better understanding. Thisclassification is based onthesemantics ofthestate space graph (ortree) generated andtheproblem domain. Itisshownthat semantics ofaproblem domain hasbeenavital aspect of thesearch enhancements. Onesemantic basedsearch enhancement, theFalse-Move isdescribed inthis paper. Thissearch enhancement inconjunction withtheA* algorithm isusedtosolve the8-puzzle problem andthe results arepresented.