A true b false exam b 3 without mutafons in genefc

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a) True, b) False Exam A: 3. Without crossovers in geneFc algorithms children will only have a single parent. a) True, b) False Exam B: 3. Without mutaFons in geneFc algorithms children will only have a single parent. a) True, b) False Exam A: 4. Consider an A* search algorithm that tries to find the opFmal goalstate with minimal cost. Consider heuristcs h1,h2 with h1(n) < h2(n) for all states n. A* with h1 is guaranteed to expand fewer nodes or an equal number of nodes to arrive at the opFmal goalstate than A* with h2. a) True, b) False Exam B: 4. Consider a best ­first search (BFS) algorithm that tries to find the opFmal goalstate with minimal cost. Consider heuristcs h1,h2 with h1(n) > h2(n) for all states n. BFS with h1 is guaranteed to expand fewer nodes or an equal number of nodes to arrive at the opFmal goalstate than BFS with h2. a) True, b) False...
View Full Document

This note was uploaded on 01/21/2014 for the course COMPSCI 171 taught by Professor Welling during the Fall '10 term at UC Irvine.

Ask a homework question - tutors are online