Carluen, Khryz Garnier G. and Marcelo, Remo Adrian A.  4  0   <br/><br/>
An enhancement of a path-findinb algorithm applied in maze solver /        6 
       6     
Carluen, Khryz Garnier G. and Marcelo, Remo Adrian A. 
 -   
 -     
 - 37 pp.     28 cm.     
 -   
 -   
 - 
 - 
 -         .
 -     .
 -          0   .
 -         .
 -  0       .
<br/><br/>   Thesis: (BSCS major in Computer Science) -Pamantasan ng Lungsod ng Maynila, 2017. 
<br/><br/>
<br/><br/>      
<br/><br/>   5 
<br/><br/>      
<br/><br/> ABSTRACT:  	Searching for the fastest way one go from a place to another has been made easy by the use of path-finding algorithms, one of which is A*, algorithm that surpasses the other of its kind with the use of heuristics to guide its search. This study aims to further enhance A* by finding its problems and its limitations, implementing it on an application and solving the problems of the existing A* algorithm are: it only produces one path, only considers distance in the calculation of the cost, and doesn't rank the paths according to optimality. Thorough research on how to improve the algorithm and comparisons between A* and other path-finding algorithms, as well as manually simulating the algorithm have been conducted. In order to solve the problems of the existing algorithm, we considered adding time as another factor in calculating the cost of the path and also allowed generating multiple optimal paths, as well as ranking the depending on their optimality. The proposed algorithm is much better for users to choose which path to take according to the multiples paths produced, and to choose if this path will take a larger distance but less time, choosing in the ranking provided. We recommend the proposed algorithm to future researchers, this can be used in their study. We also recommend to use this algorithm in different types of applications, mainly games and path-finding.       
<br/><br/>      
<br/><br/><br/> <br/> <br/> <br/> <br/> <br/> <br/> 
<br/><br/><br/>5     
<br/><br/><br/> <br/>   
<br/><br/><label>ISBN: </label>  
<br/><br/><label>ISSN: </label>2 
 =   
 =   
<br/><br/><label>Standard No.: </label>        
<br/><br/><label>Publisher. No.: </label>  
<br/><br/><label>Source: </label>        
<br/><br/><label>LCCN: </label>
<br/><br/><label>Nat. Bib. No.: </label> 2 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>    
<br/><br/><label>Subjects--Personal Names: </label><br/>     2     --0------
<br/><br/><label>Subjects--Corporate Names: </label><br/>     6 --0-- 2 --------
<br/><br/><label>Subjects--Meeting Names: </label><br/><br/> 0    2 --
<br/><br/><label>Subjects--Uniform Titles: </label><br/>  --20------
<br/><br/><label>Subjects--Chronological Terms: </label><br/> 
<br/><br/><label>Subjects--Topical Terms: </label><br/>    --------20--
<br/><br/><label>Subjects--Geographic Terms: </label><br/>--------20--
<br/><br/><label>Index Terms--Genre/Form: </label><br/>----2
<br/><br/><label>LC Class. No.: </label> / 2 
<br/><br/><label>Dewey Class. No.: </label> / 2 
<br/><br/><label>National Agricultural Library Call No.: </label> /  
<br/><br/><label>National Library of Medicine Call No.: </label> /  
<br/><br/><label>Gov. Doc. Class. No.: </label>