|
Hi. Welcome to the website of Ethan L. Schreiber. I am a 1st year graduate student at UCLA. My advisor is Adnan Darwiche. Currently I spend all of my time thinking about search and causality. Amazingly, I am taking classes from two men whose algorithms I studied in depth 2 years ago while working on my masters: Judea Pearl (Pearl's Polytree Algorithm and A* search) and Rich Korf (A* iterative deepening). Who knew I would be around all of these legends?
This is a tree of all nodes evaluated by Alpha-Beta pruning in the best case with a branching factor of 3 and a maximum search depth of 5. Pretty darn cool if you ask me. See any patterns?
|
