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.
About NLP Logix:
NLP Logix is an artificial intelligence, machine learning and process automation solutions provider, which has evolved over the last eight years to one of the fastest growing teams of deep learning practitioners. Our team of experts have extensive experience leveraging natural language processing, computer vision, neural networks, and predictive modeling to help companies revolutionize
how they operate. NLP Logix delivers automation and machine learningsolutions to customers across a wide swath of industries, including financial services, energy, healthcare, government, human resources, and many more.
For more information about NLP Logix, visit www.nlplogix.com or follow us on LinkedIn and Twitter at @NLPLogix.