Jump to content

Recommended Posts

Posted

Hi, I'm making a mob which searches all blocks in a radius from its position. If any of the blocks are of a certain block ,it approaches the block and does something.

 

However, I'm having real trouble figuring out a way of making a method which searches all blocks in a radius from a coordinate and returns an array of those blocks, does anyone have any idea on how this could be done?

 

An example method name would be getBlocksInRadius(World world, int x, int y, int z, int radius)

 

Thanks in advance!

"Thinking that coding is the nerdy IT guy at work rebooting your computer is like thinking that music is what happens when the piano tuner comes round." - Ed Rex

Posted

Hi

 

Do you mean World.getBlockID?

 

The basic algorithm would look something like

 

for z = -10 to 10

  for y = -10 to 10

    for x= -10 to 10

        if (x*x + y*y + z*z <= radius*radius)

          if World.getBlockID(x+mobx, y+moby, z+mobz) == myBlockID

{etc}

 

Is there any reason you need to return an array of all the block locations, i.e. can't you just pick one (eg the closest?)

 

-TGG

 

Posted

Thanks! I'll try that.

 

I could get the closest one.

"Thinking that coding is the nerdy IT guy at work rebooting your computer is like thinking that music is what happens when the piano tuner comes round." - Ed Rex

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.

Guest
Unfortunately, your content contains terms that we do not allow. Please edit your content to remove the highlighted words below.
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Announcements



×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.