UDEMY 2021 - Artificial Intelligence I: Basics and Games in Java
- 1. UDEMY 2021 - MCSA Windows Server(70-740) Course
- 2. UDEMY 2021 - Cisco CCNA Packet Tracer Ultimate labs: CCNA 200-301 labs [BESTSELLER]
- 3. UDEMY 2021 - Network Hacking Continued – Intermediate to Advanced
- 4. UDEMY 2021 - Web Applications Hacking and Penetration Testing (practical)
A guide how to create smart applications, AI, genetic algorithms, pruning, heuristics and metaheuristics
What you’ll learn
Understand how AI algorithms work
Able to create AI algorithms on your own from scratch
This course is about the fundamental concepts of artificial intelligence. This topic is getting very hot nowadays because these learning algorithms can be used in several fields from software engineering to investment banking. Learning algorithms can recognize patterns which can help detecting cancer for example. We may construct algorithms that can have a very good guess about stock price movement in the market.
In the first chapter we are going to talk about the basic graph algorithms. Several advanced algorithms can be solved with the help of graphs, so as far as I am concerned these algorithms are the first steps.
Second chapter is about local search: finding minimum and maximum or global optimum in the main. These searches are used frequently when we use regression for example and want to find the parameters for the fit. We will consider basic concepts as well as the more advanced algorithms: heuristics and meta-heuristics.
The last topic will be about minimax algorithm and how to use this technique in games such as chess or tic-tac-toe, how to build and construct a game tree, how to analyze these kinds of tree like structures and so on. We will implement the tic-tac-toe game together in the end.
Thanks for joining the course, let’s get started!
Who this course is for:
Created by Holczer BalazsLast updated 4/2019EnglishEnglish [Auto-generated]
Size: 1.24 GB