lecture12-StereoscopicComputerGraphics5393491403.pdf

# Category Archives: Lecture Note

# lecture11

lecture11-Physics6489406954.pdf

# lecture10

lecture10-MultiplayerGame3516077183.pdf

# Searching Algorithms

Review of Searching Algorithms

Type |
Ordering |
Optimal? |
Complete? |
Efficient? | |

Depth First |
Uninformed |
LIFO |
No |
No |
If lucky |

Breadth First |
Uninformed |
FIFO |
If step costs are identical |
Yes |
No |

Uniform Cost |
Uninformed |
g(n) |
If step cost>0 |
If step cost>0 |
No |

Greedy |
Informed |
h(n) |
No |
No |
Usually |

A* |
Informed |
g(n)+h(n) |
If heuristic is admissible |
Yes |
Yes |

# lecture9

lecture9-Game AI9074238496.pdf

# lecture8

lecture8-HCI-Usability1165294688.pdf

# lecture7

lecture7-Sound4099952306.pdf

# lecture6

lecture6-Graphics9680278468.pdf

# lecture5

lecture54550379840.pdf

# lecture4

lecture4-Designing the Game4804645020.pdf