Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7158113
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T13:00:26+00:00 2026-05-28T13:00:26+00:00

A have a maze and character that’s controlled by the player and a drone

  • 0

A have a maze and character that’s controlled by the player and a drone who has to find him (by itself). Does anyone know an (efficient) AI algorithm for doing something like this?
P.S. I know there are several path finding algorithms(e.g. A*), but as far as I know these only work for finding the path between two nodes that “don’t move” (this would work if my character was standing still, but that’s obviously not the case).

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T13:00:27+00:00Added an answer on May 28, 2026 at 1:00 pm

    If the “start point” is where the drone is, and the “end point” is to run into the player, about the best you can do using just a “standard” algorithm is to use A* periodically and from that determine where the drone needs to move.

    As you get closer to the player, you will be calculating faster and faster since the search space is, in theory, smaller.

    Using this, it would be possible for the player to find a set of positions that, when moving between them causes the drone to get “stuck” just moving back and forth, but those sorts of optimizations are situation-specific and a general algorithm won’t include them.

    Essentially, you do have a fixed search space each “frame”, but you just have to run it each frame to decide what to do.

    There are likely tweaks to A* that cover minor perturbations between runs, but I don’t know any off the top of my head.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a program that is searching a maze to find the best way
I want to build a maze with player that move on the maze board.
I have created a 2D maze, and I want to find the quickest path
I am creating a maze game. For that I have created 4 separate class
This is quite odd, because I have a Character class that can access Frame.dimension.getWidth();
I have a recursive maze solver algorithm that can successfully work its way through
I have 2 2D arrays that represent a maze const char maze1[10][11] and const
I have 2 2D arrays that represent a maze const char maze1[10][11] and const
Hello I have a class with a function that returns a pointer: int* Maze::GetStart()
My maze generator seems to have a problem. I am trying to generate something

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.