记分板树 —— 高效穷举 - 游戏技巧

Baxter

本帖最后由 Baxter 于 2022-8-20 03:06 编辑

写了个计分板树(代码很烂)，因为最近经常用到这个东西

如果你要修改生成的函数直接改这个函数，生成完后执行目录下的root函数即可

scbtree.zip (1.15 KB, 下载次数: 4)

如果你比较懒不愿意下的话直接展开复制代码吧

然后根据小豆的算法又写了一份三叉树，如果你需要的话直接拿去用吧()

import os
def strint(num):
return (str(int(num)))
def run(y,folder,function=None,namespace="",obj="int",player="#index",msg=""):
os.makedirs(f"{folder}/search",exist_ok=True)
os.chdir(f"{folder}/search")
if (namespace != ""):
funchead=f"{namespace}:{folder}/search/"
else:
funchead=f"{folder}/search/"
i=0
n=1
while(i<y):
n*=3
i+=1
m=n
while(i>1):
j=0
while(j<n):
k=j+1
j+=m
l=m/3
with open(f"{strint(k)}_{strint(j)}.mcfunction","a") as f:
f.write(f"execute if score {player} {obj} matches {strint(k)}..{strint(k+l-1)} run function {funchead}{strint(k)}_{strint(k+l-1)}\n")
f.write(f"execute if score {player} {obj} matches {strint(k+l)}..{strint(k+2*l-1)} run function {funchead}{strint(k+l)}_{strint(k+2*l-1)}\n")
f.write(f"execute if score {player} {obj} matches {strint(k+2*l)}..{strint(j)} run function {funchead}{strint(k+2*l)}_{strint(j)}")
m/=3
i-=1
j=0
while(j<n):
k=j+1
j+=3
with open(f"{strint(k)}_{strint(j)}.mcfunction",mode="a") as file:
file.write(msg.replace("$score",f"{k}").replace("$player",f"{player}").replace("$obj",f"{obj}").replace("$n","\n")+"\n")
file.write(msg.replace("$score",f"{k+1}").replace("$player",f"{player}").replace("$obj",f"{obj}").replace("$n","\n")+"\n")
file.write(msg.replace("$score",f"{k+2}").replace("$player",f"{player}").replace("$obj",f"{obj}").replace("$n","\n"))
#run(3,"test",namespace="test",player="#index",obj="int")
point=input("输入层数:")
dir=input("输入文件目录:")
ns=input("输入命名空间:")
pl=input("输入玩家:")
ob=input("输入记分板:")
msg=input("输入执行内容($score分数$player玩家$obj计分板$n换行):")
run(int(point),dir,namespace=ns,player=pl,obj=ob,msg=msg)

复制代码

计分板树有什么用呢，假如你需要穷举修改玩家的最大血量，你就要写1024条命令，通过计分板树你就可以不用执行这么多命令