algorithm

Games as search “max” and “min” two players. Max moves frist in the game. The game take turns until it’s over. Max uses search tree to determine “best” next move. Definitions initial state: set-up defined by rules player(s): which player has the move in state s actions(s): set of legal moves in state results(s, a): transition model defines result of a move terminal_test(s): true if the game is finished; false otherwise utility(s, p): the numerical value of terminal state s for player p win: 1, lose :-1, draw: 0 Procedure generate the whole game tree to leaves apply utility function to leaves back-up values from leaves toward the root: Max node computes the max of its child values Min node computes the min of its chidl values at root: choose move leading to the child of highest value e....

*A smart and interesting sorting. Suppose I have five elements: a, b, c, d, e. And I want to sort them in 7 steps: Step 1: 3 comparisons: if a > b: swap(a, b); if c > d: swap(c, d); if b > d: swap(b, d), swap(a, c)  Step 2: 2 comparisons: now I need to find the position for e in {a, b, d}: if (e < b) if (e < a) e a b d else a e b d else if (e < d) a b e d else a b d e !...