Python Forum
Theory question on grid neighbors
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Theory question on grid neighbors
#4
This sounds almost like the beginning steps in some path finding algorithms but with very short paths. That might be a place to start searching. Try a search for A* (A-Star).
Algorithms to break 2D/3D grids apart into specifically shaped pieces also sound like something that is too useful not to have been done before but I didn't find anything that exactly matches your 'Tetris' shape finder.
I'm sure making it efficient when the grid gets large will be a challenge. If I can think of anything else I'll post back...
"So, brave knights, if you do doubt your courage or your strength, come no further, for death awaits you all with nasty, big, pointy teeth!" - Tim the Enchanter
Reply


Messages In This Thread
Theory question on grid neighbors - by Clunk_Head - Dec-16-2019, 08:25 PM
RE: Theory question on grid neighbors - by Marbelous - Dec-16-2019, 09:45 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Queuing Theory in Python NOLA_Saints 0 1,407 Feb-22-2023, 11:42 PM
Last Post: NOLA_Saints
  Theory behind referencing a dictionary rather than copying it to a list sShadowSerpent 2 2,921 Mar-24-2020, 07:18 PM
Last Post: sShadowSerpent
  Applied Graph Theory daniellemmoore 2 4,454 Mar-14-2017, 09:47 PM
Last Post: zivoni

Forum Jump:

User Panel Messages

Announcements
Announcement #1 8/1/2020
Announcement #2 8/2/2020
Announcement #3 8/6/2020