Classic AI: Graph Traversal for Solving Tough Problems

Kyle Pena
Data Scientist
About This Event

By representing problems as searches over Directed Acyclic Graphs (DAGs), we can solve 'tough' AI problems - like finding the fastest route to a destination, playing two player games like Chess or Checkers, or even finding the best Scrabble move! However, there are several 'gotchas' when dealing with extremely large problem spaces (i.e.; all possible letter combinations in Scrabble). We discuss these pitfalls in detail, suggest a variety of Search Strategies like Depth First, Best First, Beam Search, Breadth First, and Iterative Deepening. Code and results are demonstrated in Python.

July 27, 2019
9:45 am
See Full Schedule
Sponsor CotB 2019

Be an important part of the history of this community and this growing conference. We customize each sponsorship package so drop a line and we will get in touch with you.

I Want to Sponsor


1649 Norman Street, Los Angeles,


8 (800) 807-2437

Follow Us

Contact Us