Abstract: A greedy algorithm called FBG is presented, which finds optimal cost solutions of an explicit AND/OR graph containing cycles, and has a good property. The strict correctness proof of the algorithm is given, and its complexity is analyzed briefly.