Home /
Expert Answers /
Computer Science /
nbsp-help-a-prove-that-the-set-of-states-expanded-by-algorithm-a-is-a-subset-of-those-examin-pa520
(Solved):
Help
a) Prove that the set of states expanded by Algorithm A* is a subset of those examin ...
Help
a) Prove that the set of states expanded by Algorithm A* is a subset of those examined by Breadth- First Search Algorithm. [10] [10] b) Develop a comparative framework for search algorithms. QUESTION FIVE a) State problem formulation in Artificial Intelligence? b) Consider the following fitness function: Fitness()= number of 0's in the bitstring where both adjacent bits are 1s For example, Fitness("0101101010")=3, Fitness("100011011") = 1, and Fitness("010101010") = 3. Assume the design of our genetic algorithm is: 1. Create an initial population containing 4 random 9-bit strings. 2. Discard the 2 least-fit ones (break ties randomly). 3. Do a cross-over using the 2 most fit. The 2 children that results and their parents constitute the next generation. [4] 4. Randomly mutate 1 bit in 1 string in the population. 5. Go to step (2) i. Start with the initial population below and show what the next three (3) generations might look like. Explain your reasoning. [16] Generation 0 011110110 011001011 101101110 000010101
Solution : a) The A* heuristic function is more informed than BFS. This is also the base for proving it. h' (n) = 0 is also an admissible heuristic function. BFS