artificial intelligence chapter 4

1. backtraking search algorithm (solution, current state (cs),state list (sl), new state list (nsl), dead end (de)
2. blind search (evaluated nodes [*1st evaluates=o], opened, closed)
1. breadth 1st search (S)
2. deadth 1st search (w)
3. heuristic search
1. hill climbing (evaluated nodes, opened, closed)
2. best 1st search (evaluated nodes, opened, closed) *ade number. perlu compared dan susun balik ikut nilai number.amik number paling kecil.
3. a* algorithm f(n)=g(n)+h(n) *jangan luper masukkan sekali nilai h(n) y sebelumnya. example games puzzle susun number.,tulis semua kebarangkalian.
4. heuristic search in games
1. minimax max/min player start at top
2. alpha-beta prunning (right to left-answer=left)/(left to right-answer=right)

conditon for alpha-beta

• compared with sibling
• if fulfill=update
• if not fulfill=maintain
• compared with uncle
• if fulfill=visit siblings
• if not fulfill=prune

*notes AI