{"title":"HSAS: a heuristic development tool","authors":"P. Nelson, J. Dillenburg, Lana Dubinsky","doi":"10.1109/TAI.1990.130384","DOIUrl":null,"url":null,"abstract":"The authors present HSAS (heuristic search animation system), a tool which uses algorithm animation to aid the development of heuristics. HSAS has been used to analyze A* and study another search algorithm which uses islands or subgoals. It has been demonstrated that algorithm animation can be a useful tool when developing heuristics. The tool presented, HSAS, is a stepping stone into the arena of full-blown algorithm animation systems. When completed, HSAS will provide a complete environment for creating, debugging, and comparing heuristics.<<ETX>>","PeriodicalId":366276,"journal":{"name":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1990.130384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The authors present HSAS (heuristic search animation system), a tool which uses algorithm animation to aid the development of heuristics. HSAS has been used to analyze A* and study another search algorithm which uses islands or subgoals. It has been demonstrated that algorithm animation can be a useful tool when developing heuristics. The tool presented, HSAS, is a stepping stone into the arena of full-blown algorithm animation systems. When completed, HSAS will provide a complete environment for creating, debugging, and comparing heuristics.<>