search

mikepound / cubes

This code calculates all the variations of 3D polycubes for any size (time permitting!)
MIT License
165 stars 42 forks source link

n=12 npy file. #9

Closed bertie2 closed 1 year ago

bertie2 commented 1 year ago

you didn't say where to put the n>11 files so I will be dumping them in this issue.

https://drive.google.com/file/d/1oKcpgGCj4CCuYqJyWKglPqRbO8WNjaB5/view?usp=sharing

count agrees with kevin gongs numbers exactly.

please note this was generated by my own parallelized version of your code at @ https://github.com/bertie2/cubes/tree/parallelism so I may have introduced some weird bug, however since the numbers match with kevins I'm pretty confident.

also these files are going to get biiiiig as time goes on, so might want to look for a sane way to host them.

in the mean time i'm throwing more cores at the issue and looking at porting over to c# so will see you at n=13

mikepound commented 1 year ago

Well - this didn't take you long! Well done! I'll upload this to my google cloud, but you're absolutely right that these grow by about 7x each n+1, which is somewhat a concern!