purplemonkeymad

joined 2 years ago
[–] purplemonkeymad 4 points 1 day ago

Ui team probably not connected to milage cheating team. This is the kind of thing you can't do test cases for, so unexpected "bugs" will get out.

[–] purplemonkeymad 3 points 6 days ago

Coming from a technical side, I don't think that would be difficult. It's not like you would have to hand control of the subdomain over to them, DNS verification codes can just be given to those who's control the domain, they are public information. But that's just my opinion.

Thanks for the info.

[–] purplemonkeymad 6 points 1 week ago (2 children)

I thought that was the point of the domain verification for your handle? That way you can be verified as you have the same handle as your official website or business.

[–] purplemonkeymad 1 points 1 week ago (1 children)

Turbo. This should be fine for completing phase 3.

Nice compact setups, i gotta wait for a larger blueprint designer to do more compact ones. I went for ease of placement this time as there is still space.

[–] purplemonkeymad 3 points 1 week ago

I'm not sure I can even start the plant I have with the available power I do have. More will have to wait, but will probably come for sure.

[–] purplemonkeymad 2 points 1 week ago

Yes, should be some thing like 22gw if my maths is correct. I have a phase 2 to build that will use the rest of the oil node for diluted fuel gens to push to 30ish. Need some more slugs for that.

For now I'm sinking the resin, but it'll go out to a personal supply of computers and high speed connectors later.

 

36 refineries to supply 36 fully over-clocked Fuel Gens. This is only the last step.

Should give me enough power for a while tho.

[–] purplemonkeymad 3 points 1 week ago

No, no ,no. You roll out a wildly overreaching implementation so everyone one is upset, that way you can release a just mostly overreaching version and everyone thinks it's better than what you tried last time.

 

It's nice to finally have a manufacturer so that I can automate the 3 items recipes, it was getting annoying having to do them at the bench.

 
[–] purplemonkeymad 1 points 2 weeks ago

I think that depends on common shoe sizes. With the biggest feet there is no way I could put on anyone else's socks.

 

Ignore the mess in the background, I'm working on it.

[–] purplemonkeymad 36 points 2 weeks ago (1 children)

Mailman is going to think something is wrong with me when he just keeps getting "up arrow." Probably even more when I stop on a short command.

[–] purplemonkeymad 9 points 2 weeks ago

Makes sense, the artist panel has a robot after all.

[–] purplemonkeymad 4 points 3 weeks ago

PC for the Game, Laptop for Satisfactory Modeller, tablet for wiki, and a paper notepad and pen for writing down numbers.

[–] purplemonkeymad 3 points 3 weeks ago

Looks nice, I like it. May steal the pillar tops idea at some point.

 

Some other stuff has been re-sized or model swapped as well.

 

Would have been nice to have mk2 pipes, but I don't have enough power to get there yet. Dipping into the bio fuel just to keep things running.

 
 

So I managed to get part 1 of the day, but it took 2 seconds to run on the real input, which is a bad sign.

I can't see any kind of optimisation that means I can skip checks and know how many combinations are in those skipped checks (aside from 0.) I can bail out of branches of combinations if the info so far won't fit, but that still leads me to visiting every valid combination which in one of the examples is 500k. (And probably way more in the input, since if I can't complete the example near instantly the input is not happening.)

Right now I take the string, then replace the first instance of a ? with the two possible options. Check it matches the check digits so far then use recursion on those two strings.

I can try to optimise the matching, but I don't think that solves the real problem of visiting every combination.

I don't think (or hope) it's just bad code but this is my code so far (python.)

edit:

spoilera cache was the solution!

view more: next ›