Yaossg/slime
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Support custom slime chunk patterns in CUDA finder

Browse source
This commit is contained in:
Yaossg 2026-10-16 23:51:12 +08:00
parent dd5fab9540
commit 7952207735
10 changed files with 2302 additions and 34 deletions
Download patch file Download diff file Expand all files Collapse all files

43
bench/test_math.cu
View file

@ -2,9 +2,17 @@
#include "slime_bench.cu"
#undef main
#include <random>
struct HostEmit{
const sr::CellTerm* cells;int count;std::set<uint64_t>* result;
__host__ __device__ void operator()(uint64_t seed){
#ifndef __CUDA_ARCH__
if(sr::verifyPattern(seed,cells,count))result->insert(seed);
#endif
}
};
void check(bool ok,const char*msg){if(!ok)throw std::runtime_error(msg);}
int main(){
uint64_t points=0,groups=0;std::mt19937_64 rng(123456);
uint64_t points=0,groups=0,mixed=0;std::mt19937_64 rng(123456);
for(int r=0;r<=64;++r){Config c;c.x=-123;c.z=98;c.radius=r;std::set<std::pair<int32_t,int32_t>> actual;
for(uint64_t i=0;i<anchors(r);++i){auto p=coordinate(c,i);actual.emplace(p.x,p.z);}
check(actual.size()==anchors(r),"duplicate anchor");
@ -21,5 +29,36 @@ int main(){
uint32_t expected=0;for(int j=0;j<16;++j)if(fs::differenceFilter(root+(uint64_t(base+16*j)<<18),cells.data(),count))expected|=1U<<j;
check(groupMask(prepared.data(),base,count)==expected,"variable-size group mask mismatch");++groups;
}
std::cout<<"{\"diamond_points\":"<<points<<",\"variable_size_groups\":"<<groups<<",\"passed\":true}\n";
// Compare arbitrary sparse layouts and forbidden cells against all high bits.
for(int t=0;t<128;++t){
Coord coord{int32_t(rng()),int32_t(rng())};
// Keep offsets away from overflow even for signed boundary samples.
coord.x/=2;coord.z/=2;
uint64_t world=rng()&sr::kMask48;
std::string text;
for(int z=0;z<5;++z){if(z)text+='/';for(int x=0;x<7;++x)
text+=(x==0&&z==0)||rng()%4==0?'?':sr::exactIsSlimeFromTerm(world,sr::coordinateTerm(coord.x+x,coord.z+z))?'#':'.';}
if(text.find('#')==std::string::npos)continue;
auto pattern=parsePattern(text);int count=pattern.cells.size();
std::vector<sr::CellTerm> cells(count);terms(coord,pattern,cells.data());
uint64_t normalized=(world+sr::coordinateTerm(coord.x+pattern.cells.front().x,coord.z+pattern.cells.front().z))&sr::kMask48;
check(sr::verifyPattern(normalized,cells.data(),count),"normalized pattern mismatch");
uint64_t low=normalized&((1ULL<<35)-1);std::set<uint64_t> actual,expected;
HostEmit emit{cells.data()+pattern.positive,count-pattern.positive,&actual};
fs::solveIntervals(low,cells.data(),pattern.positive,emit);
for(uint64_t high=0;high<8192;++high){uint64_t seed=low+(high<<35);
// Ordinary branch requires a successful first draw at positive cells.
bool ordinary=true;for(int i=0;i<pattern.positive;++i)
if((sr::nextStateFromTerm(seed,cells[i].term)>>17)%10!=0)ordinary=false;
if(ordinary&&sr::verifyPattern(seed,cells.data(),count))expected.insert(seed);
}
check(actual==expected,"mixed pattern high-bit solver mismatch");++mixed;
uint32_t root=low&262143,base=uint32_t(low>>18)&~240U;
std::vector<uint32_t> prepared(count*2);
for(int i=0;i<pattern.positive;++i){uint64_t a=root+cells[i].term;
prepared[2*i]=a>>18;prepared[2*i+1]=((((a^sr::kCombinedXor)&262143)*sr::kJavaMultiplier+11)>>17);}
uint32_t wanted=0;for(int j=0;j<16;++j)if(fs::differenceFilter(root+(uint64_t(base+16*j)<<18),cells.data(),pattern.positive))wanted|=1U<<j;
check(groupMask(prepared.data(),base,pattern.positive)==wanted,"sparse pattern group mask mismatch");
}
std::cout<<"{\"diamond_points\":"<<points<<",\"variable_size_groups\":"<<groups<<",\"mixed_pattern_slices\":"<<mixed<<",\"passed\":true}\n";
}