仙人掌基础版

使用说明

1. 复制完整文件到游戏中运行。材料充足时持续循环；种植与排序都由单架无人机完成。

运行前提与限制

四个版本都按 32×32 编写，需要仙人掌和足够的种植材料；每轮会清场重种。多机条带版还需要相应的无人机能力。

各版本采用不同的排序和调度方式。目前没有统一的游戏内计时结论，可从基础版开始，再按无人机数量选择多机版。

运行环境：游戏内代码窗口。说明由 AI 辅助整理；更多对照版本、测试和记录见仙人掌目录。

完整源码

cactus_32.py · 143 行。代码块右上角可复制完整代码。

# The Farmer Was Replaced - 32x32 cactus megafarm
WORLD_SIZE = 32
WATER_MINIMUM = 0.5


def goto(x, y):
	while get_pos_x() != x:
		dx = (x - get_pos_x() + WORLD_SIZE) % WORLD_SIZE
		if dx <= WORLD_SIZE / 2:
			move(East)
		else:
			move(West)

	while get_pos_y() != y:
		dy = (y - get_pos_y() + WORLD_SIZE) % WORLD_SIZE
		if dy <= WORLD_SIZE / 2:
			move(North)
		else:
			move(South)


def water_tile():
	while get_water() < WATER_MINIMUM and num_items(Items.Water) > 0:
		use_item(Items.Water)


def can_afford_field():
	cost = get_cost(Entities.Cactus)
	if cost == None:
		return False
	for item in cost:
		if num_items(item) < cost[item] * WORLD_SIZE * WORLD_SIZE:
			return False
	return True


def plant_columns(column_count):
	for column in range(column_count):
		for row in range(WORLD_SIZE):
			if get_ground_type() != Grounds.Soil:
				till()
			water_tile()
			if get_entity_type() == None:
				plant(Entities.Cactus)
			move(North)
		move(East)

	# Each worker waits for its own newest cactus. Earlier cacti in the same
	# strip were planted sooner with at least the same minimum water level.
	last_x = (get_pos_x() - 1) % WORLD_SIZE
	goto(last_x, WORLD_SIZE - 1)
	while not can_harvest():
		water_tile()


def plant_field():
	clear()
	goto(0, 0)
	plant_columns(WORLD_SIZE)


def sort_column(column_x):
	goto(column_x, 0)
	low = 0
	high = WORLD_SIZE - 1

	# Random first dimension: continuous bidirectional scans minimize movement.
	while low < high:
		swapped = False
		last_swap = low
		y = 0

		while y < high:
			if measure() > measure(North):
				swap(North)
				swapped = True
				last_swap = y
			move(North)
			y = get_pos_y()

		high = last_swap + 1
		if not swapped:
			break

		swapped = False
		last_swap = low

		while y > low:
			if measure() < measure(South):
				swap(South)
				swapped = True
				last_swap = y - 1
			move(South)
			y = get_pos_y()

		low = last_swap + 1
		if not swapped:
			break


def sort_columns():
	for column in range(WORLD_SIZE):
		sort_column(column)


def sort_row():
	row_y = get_pos_y()

	# Adjacent-swap insertion sort performs exactly one swap per inversion.
	for start_x in range(1, WORLD_SIZE):
		goto(start_x, row_y)
		x = start_x
		value = measure()
		while x > 0 and value < measure(West):
			swap(West)
			move(West)
			x -= 1


def sort_rows():
	goto(0, 0)
	for row in range(WORLD_SIZE):
		sort_row()
		move(North)


def run_cactus_cycle():
	plant_field()
	sort_columns()
	sort_rows()

	# Rows increase West->East and columns increase South->North.
	# One harvest propagates through all 1024 mature cacti.
	goto(0, 0)
	if can_harvest():
		harvest()
		return True
	return False


while can_afford_field():
	if not run_cactus_cycle():
		break