ARTIFICIAL INTELLIGENCE I: BASICS AND GAMES IN JAVA

ARTIFICIAL INTELLIGENCE I: BASICS AND GAMES IN JAVA 528460 81ed 2 1


Advertisement

A design on how to create smart applications, AI, generative algorithms, pruning, heuristics, and metaheuristics

What you’ll learn

Get a general grasp of artificial intelligence

Determine how AI algorithms work

Able to design AI algorithms on your own from scar

Advertisement

Allow to meta-heuristics

Conditions

Basic Java (SE)

Some basic algorithms ( maximum/minimum finding )

Essential math ( duties )

Description

Advertisement

This course is about the primary ideas of artificial intelligence. This topic is taking very passionate now because these learning algorithms can be used in various fields from software engineering to finance banking. Practice algorithms can recognize patterns that can help to identify cancer for example. We may develop algorithms that can have a very good guess about funds price move in the market.

Division 1:

pathfinding algorithms

graph traversal (BFS and DFS)

enhanced analysis algorithms

An analysis algorithm

Division 2:

primary optimization algorithms

brute-force analysis

stochastic analysis and hill-climbing algorithm

Division 3:

heuristics and meta-heuristics

tabu analysis

simulated annealing

generative algorithms

particle swarm optimization

Division 4:

minimax algorithm

amusement trees

applications of play trees in chess

tic tac toe entertainment and its implementation

In the opening chapter, we are persevering to talk about the basic graph algorithms. Various excellent algorithms can be determined including the help of graphs, so as far as I am troubled these algorithms are the initial steps.

The next chapter is about social exploration: finding minimum and maximum or global optimum in the central. These analyses are used frequently when we use regression for example and need to determine the parameters for the fit. We will examine primary ideas as well as the more complicated algorithms: heuristics and meta-heuristics.

The closing topic will be concerning the minimax algorithm and how to use this system in games such as chess or tic-tac-toe, how to build and make a game tree, how to explain these kinds of tree-like arrangements and so on. We will make the tic-tac-toe game respectively in the end.

Thanks for participating the course, let’s get glowing!

What this course is for:

This course is meant for students or anyone who fascinated in programming and have some knowledge in fundamental Java

Size: 1.24 GB

Download

Advertisement

Add a Comment

Your email address will not be published. Required fields are marked *