Scribd
Upload
9 views

Non-deterministic Game Algorithm 2

AI related topic

Uploaded by

RAMJAN ALI KHA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

Non-deterministic Game Algorithm 2

AI related topic

Uploaded by

RAMJAN ALI KHA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Welcome to Our presentation.

Non-deterministic Game Algorithm


Presented by

A K M S Limon (200117)

Mohammad Azazul Islam (200118)

Tamim Sheikh (200119)

Tarin Prosad Ghosh (200120)


introduction

A non-deterministic game algorithm introduces an element of randomness or unpredictability


into the decision-making process within a game.
In contrast to deterministic algorithms, which follow a strict, predictable logic (given the same
initial state, they always produce the same outcome), non-deterministic algorithms can yield
different results even with the same inputs.
This characteristic makes them particularly useful for creating dynamic and less predictable
gaming experiences.
This algorithm gives the enemy a 50% chance of attacking, 20% of defending or healing, and a
10% chance of fleeing. The unpredictability makes each encounter feel more organic.
Structured

1.Randomness in Decision-Making

• Probability-Based Decisions:

Use probabilities to decide on actions.

For instance, a character in a game might have a 70% chance of attacking,

20% chance of defending, and a 10% chance of retreating.

This randomness can make gameplay feel more natural and less predictable.

• Random Number Generators (RNG):

Generate random numbers to introduce variability in outcomes.

RNGs can determine events like loot drops, enemy actions, or environmental changes,

ensuring that outcomes vary each time the game is played.


Structured

2. Procedural Content Generation (PCG)


• Level Generation: Use algorithms to generate game levels in a non-deterministic way, so
each playthrough offers a unique experience.

• Examples include roguelike games where dungeons are generated anew with each session.

• Item or Loot Generation: Randomly generate items with various attributes. This
approach can lead to a wide variety of items that players can find, making each session
feel fresh.

3. Monte Carlo Tree Search (MCTS)


MCTS is a popular non-deterministic algorithm in AI for decision-making in games.

It explores potential future moves by simulating thousands of possible game states

and using randomness to determine the sequence of moves.

This can be useful in games like chess or Go, where the algorithm explores possible
outcomes to decide on an optimal move without following a rigid path.
Structured

4. Simulated Annealing

• A technique that introduces randomness to avoid local minima in


optimization problems. In game AI, this might help a character AI avoid
making the same moves repeatedly, creating a more complex and
engaging challenge.

5. Fuzzy Logic

• Instead of absolute decision rules, fuzzy logic introduces degrees of truth to


decisions. For example, rather than categorizing an enemy as either
“strong” or “weak,” fuzzy logic assigns probabilities to each category,
allowing the AI to make more nuanced, unpredictable decisions
Applications

•Roguelike Games:
• Randomly generated dungeons, enemies, and loot.

•AI Opponents: Games like chess, where the AI doesn’t always follow a strict set of
rules, can provide a more challenging experience.

•Procedural Worlds: Games that generate worlds, landscapes, or levels on the fly (e.g.,
Minecraft or No Man’s Sky).
Thank You…

You might also like