┌──────────────────── ────────────────────┐
│░░░░░░░░░░░░░░░░░░░░ ░░░░░░░░░░░░░░░░░░░░│
│░░░░░░ ARTIFICIAL INTELLIGENCE ░░░░░░│
│░░░░░░░░░░░░░░░░░░░░ ░░░░░░░░░░░░░░░░░░░░│
└──────────────────── ────────────────────┘
This article is based on material
given in one of the chapters of the book "Secrets
game programming" (Published by PETER, 1995).
You see what I got.
The human mind is
an abyss filled with past, present and
future. He is aware of his own
existence and is in a certain sense
just a device with the ability to self-
organization and the ability to ask questions
dew about your sense of self. Computing
technology is on the threshold of understanding the me-
mechanisms of thought, memory and consciousness.
So let's begin. The simplest algorithms
the mothers of artificial intelligence are
the so-called PURSUIT ALGORITHM and
its opposite is the EVIDENCE ALGORITHM.
Basically they force the game object
either catch up with the player or run away from him.
░░░░░░░░░░░░░ PERSECUTION ░░░░░░░░░░░░░░
Everything is simple here - first you need to set the coordination
dinata of both objects, then you need to follow
use the following algorithm:
█ If the enemy is on the right, i.e. its X-
coordinate is greater than the corresponding coordinate -
player's nat, the pursuer reduces his
position along the X axis on 1-tsu and thereby approx.
licks the player. Ifenemy naho -
is to the left of the player, he, on the contrary, increases
its horizontal coordinate.
█ The same logic applies to changes
stretching vertically.
░░░░░░░░░░░░░░░ EVADERATION ░░░░░░░░░░░░░░░░
Evasion is quite simple, it’s all about
equivalent to the pursuit algorithm:
█ If the enemy is on the right, i.e. its X-
coordinate is greater than the corresponding coordinate -
player's nat, the opponent increases his
position along the X axis by another 1st and thereby
further moves away from the player. If against -
the nickname is to the left of the player, he, on the contrary,
decreases its horizontal coordinate.
█ The same logic applies to changes
stretching vertically.
That's all for now. Talking about artificial
no intelligence I think to continue in the 2nd
issue of our newspaper. Next time we
let's talk about the topics:
1) PATTERN THOUGHTS
2) RANDOM MOVEMENTS
3) FINITE MACHINES
4) POSSIBLE MACHINES
5) MEMORY AND LEARNING
6) SEARCH ALGORITHM. TRACKING A PLAYER
7) GAME THEORY
__________________________________________
Share your thoughts about the article