if i wanted to build a program that solves simple puzzles using a* search algorithm, do i need to consider avoiding repeated states when expanding frontier in state space? I ask this because obviously it would be important to avoid repeated states and take it into consideration when solving a problem using an uniformed-search method. but because a* uses information about the problem and tends to pick states to expand that are on the complete and optimal path to the goal, then maybe you do not need to worry about coding a mechanism to avoid repeated states using a* (i.e. a* will avoid the repeated states anyway)???
thanks for the help.