Artificial Intelligence Game Playing Agents

https://www.0daydown.com/wp-content/uploads/2021/11/4372818_0570_3.jpg

MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English | Duration: 18 lectures (3h 21m) | Size: 4.44 GB

Concepts, Principles and practices of building Artificial Intelligence based systems to play games


What you’ll learn:
Concepts, Principles and practices of Artificial Intelligence Game Playing Agent
Game Playing: Games, Optimal Decisions in Games, The minimax algorithm, Optimal decisions in multiplayer games, Alpha Beta Pruning, Move ordering
Imperfect Real-Time Decisions, Cutting off search, Forward pruning. Stochastic Games, Evaluation functions for games of chance
Partially Observable Games, Krieg spiel: Partially observable chess, Card games, State-of-the-Art Game Programs, Alternative Approaches

Requirements
Fundamental Mathematics

Description
The objective of this course is to teach the concepts, principles, and practices used to develop artificial intelligence-based game programs.

Games are played by people to prove the intelligence and skill of the players. As Artificial Intelligence spans across domains to build machines as capable as humans, both physically and cognitively, Artificial Intelligence-based Games programs is one of the emerging areas in technology. In 1997, the first Game playing machine, IBM Deep Blue defeated the Russian Chess Grandmaster, Garry Kasparov it was looked at as a historic beginning of the competition between machines and man. In this course, we begin with a brief introduction to the structure of an Intelligent Agent. We begin with a simple two-person Min – Max zero-sum game in which the win amount of one player is the loss of the other. The min-max algorithm aims at exploring all possibilities estimating the worst-case guaranteed amount and choosing the move. We also extend to multiplayer games where the utility function is a vector of dimension k (number of players). Alpha Beta Pruning increases the speed in decision making, by pruning some unwanted branches of the search tree. As the number of nodes to be explored is exponentially many, we try to develop some meaningful heuristic approach to develop an algorithm to cut off a few branches and get some imperfect real-time solutions. Skill-based games are played purely with the skills of players. Stochastic games combine some stochastic experiments to decide who will do the next move and how. We also deal with stochastic games and the algorithms to choose the next move. Some games are fully visible by both the players while in some games, a player’s board is hidden from the other. Partially observable games use statistical methods to arrive at meaningful solutions. We also discuss some state-of-the-art game programs and modern approaches.

Who this course is for
Software Engineers aspiring to grow in their career
Science and Engineering Students
Officials who want to specialize in the emerging Artificial Intelligence domain


Password/解压密码www.tbtos.com

此隐藏内容查看价格4立即支付

会员内容与购买链接内容一样,升级VIP全部资料免费

此隐藏内容仅限VIP查看升级VIP

0

评论0

没有账号? 注册  忘记密码?