Plotting complicated gridbased movement

xRegnarokx

xyz I think my brain wasn't thinking through the logic well.

What I want I believe is

if i > num +1 or i < num -1:
     Continue

I have a loop for i in 7, to grab the directions, but I only want the direction and the direction right and left of it. So, to optimize I want to skip the other 4 iterations that aren't one of three, to prevent them having to go through several if statements.

xyz

xRegnarokx Then I'd be better to just loop through directions you want because with skipping you still iterate all 6 direction and execute an if for each one.

xRegnarokx

xyz However, 1 ~~_if~~ statement is better than 2-4, so, if I can continue past certain iteration rather than having them check through several things.. here I'll post the code that I modified that now does what I want it to (It is very pragmatic, there may be a simpler way of doing what I've accomplished).

func get_next_steps(current: Step, ship_rotation):
	var out: Array[Step] = []
	const directions = [Vector2i(-1,0),Vector2i(0,-1),Vector2i(1,-1),Vector2i(1,0),Vector2i(0,1),Vector2i(-1,1),Vector2i(-1,0),Vector2i(0,-1)]
	const face_dir = [null,Vector2(0.5,0),Vector2(0.5,0.5),Vector2(-0.5,0.5),Vector2(-0.5,0),Vector2(-0.5,-0.5),Vector2(0.5,-0.5),null]
	const face_dir2 = [Vector2(0.5,-0.5),Vector2(0.5,0),Vector2(0.5,0.5),Vector2(-0.5,0.5),Vector2(-0.5,0),Vector2(-0.5,-0.5),Vector2(0.5,-0.5),Vector2(0.5,0)]
	if current.movement_points > 0:
		out.resize(8)
		for i in 8:
			if i > face_dir.find(current.ship_face) +1 or i < face_dir.find(current.ship_face) -1:
				continue
			if i == face_dir.find(current.ship_face):
				if current.rotation_cd == ship_rotation:
					out[i] = Step.new(current.position + directions[i], current.movement_points - 1, current.rotation_cd, current.ship_face)
				else:
					out[i] = Step.new(current.position + directions[i], current.movement_points - 1, current.rotation_cd + 1, current.ship_face)
			if i == face_dir.find(current.ship_face) +1 or i == face_dir.find(current.ship_face) -1:
				if current.rotation_cd == ship_rotation:
					out[i] = Step.new(current.position + directions[i], current.movement_points - 1, 1, face_dir2[i])
	return out

I used your code that you had shown me as a base form, and tweaked the elements, like I removed the ready() initialization in order to have it activated by input, and I obviously added variables. However, I managed to get what I wanted from this, and now I want to mess around with it and figure out if I can streamline it.

xyz

xRegnarokx For your system the best opportunity to speed it up is to not push steps where there is no branching, i.e. the steps where rotation is not yet cooled down.

The entries on stack represent nodes in a search tree. If there is no branching, there's no need for a node. So if you're standing at hex A and you turned, you know that next N hexes you need to go into same direction without branching until you reach hex B. In this situation you only push hex B, but all hexes between A and B you only add to the output array.

So in the situation depicted above, you push orange hexes while adding white hexes immediately to the final output array.

Also get_next_steps() can be "upgraded" into push_next_steps() so it directly pushes the steps onto the stack. That way you skip building proxy return arrays all the time, which may get costly as the number of steps increases almost exponentially.

xRegnarokx

xyz Okay nice, thanks. I was just about to stop programming for the night because I like ending on a completed problem, but this is something that'll mess around with now. I also realized what I was doing before didn't really matter because there would be effectively 2 if statements being checked, and all I was doing was forcing the 3 good iterations to check 2 extra if statements. I was actually adding more baggage.

Edit:
So, I messed around with what you suggested, I figured out how I'd push them to the stack, however, for the first part I am unsure how to append all the in between hexes into the output array. Currently I store the rotation_cd within the stack in order to check if I can rotate, without that I don't know how to keep track of rotation_cd. Here is what I have..

var stack: Array[Step]
var output: Array[Vector2i]

func push_next_steps(current: Step, ship_rotation):
	const directions = [Vector2i(-1,0),Vector2i(0,-1),Vector2i(1,-1),Vector2i(1,0),Vector2i(0,1),Vector2i(-1,1),Vector2i(-1,0),Vector2i(0,-1)]
	const face_dir = [null,Vector2(0.5,0),Vector2(0.5,0.5),Vector2(-0.5,0.5),Vector2(-0.5,0),Vector2(-0.5,-0.5),Vector2(0.5,-0.5),null]
	const face_dir2 = [Vector2(0.5,-0.5),Vector2(0.5,0),Vector2(0.5,0.5),Vector2(-0.5,0.5),Vector2(-0.5,0),Vector2(-0.5,-0.5),Vector2(0.5,-0.5),Vector2(0.5,0)]
	if current.movement_points > 0:
		for i in 8:
			if i == face_dir.find(current.ship_face):
				if current.rotation_cd == ship_rotation:
					stack.push_back(Step.new(current.position + directions[i], current.movement_points - 1, current.rotation_cd, current.ship_face))
				else:
					stack.push_back(Step.new(current.position + directions[i], current.movement_points - 1, current.rotation_cd + 1, current.ship_face))
			if i == face_dir.find(current.ship_face) +1 or i == face_dir.find(current.ship_face) -1:
				if current.rotation_cd == ship_rotation:
					stack.push_back(Step.new(current.position + directions[i], current.movement_points - 1, 1, face_dir2[i]))
	return stack

func get_movement_area(start_position: Vector2i, movement_points: int, rotation_cd: int, ship_face: Vector2, ship_rotation: int): 
	stack = [Step.new(start_position, movement_points, rotation_cd, ship_face)]
	while not stack.is_empty():
		var current = stack.pop_front()
		output.append(current.position)
		for next in push_next_steps(current, ship_rotation):
			pass
	return output

« Previous Page