Artificial Intelligence for Managers by Malay A. Upadhyay

Author:Malay A. Upadhyay [Upadhyay, Malay A.]
Language: eng
Format: epub
ISBN: 9789389898385
Publisher: BPB Publications
Published: 2021-11-15T00:00:00+00:00

6.3 Search Algorithms and Monte Carlo Simulation

When Alphabet Inc., Google's parent company, built AlphaGo, a computer program that could play the immensely complex board game, Go, or when IBM Watson built DeepBlue to play chess, these machines were primarily trained to search for a significantly higher number of possible moves in the board game to deduce the risk levels and potential outcomes in each case, to decide which move they should make next. On a fundamental level, the technique used to search and find the best option is a Search algorithm, while the one to assess risks in a given scenario and with any step is called Monte Carlo simulation.

Search is a very common technique that AI has to use in many applications every time it has to search for the best solution or action to take, from an array of options. Have you ever wondered how dependent we are today on Search algorithms? Every time we want answers, we go looking for it online, and all we can learn on any topic depends on what shows up in the first few pages of the search results. That means all our knowledge is increasingly becoming dependent and limited to what the search engine AI shows us on the internet! Think about it: That information may be limited, inaccurate, or irrelevant, and there is little most of us can do about it.

Search algorithms are constantly evolving to be more and more relevant. The basic approach is to specify the current or Start State as well as a desired state or goal that the program has to achieve. The set of actions that the AI has to take to reach from the start state to the desired state is called a Plan. After each step, the program undergoes a goal test to check whether it has reached the desired state and, wherever possible, also calculate what the next set of actions would cost the solution to reach its goal. It is how it determines what the shortest or the least costly route is:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.