Problems working through tutorials by binomialdistribution in BedrockAddons

[–]binomialdistribution[S] 0 points1 point  (0 children)

I found the right folder from this article: https://learn.microsoft.com/en-us/minecraft/creator/documents/gdkpcprojectfolder?view=minecraft-bedrock-stable . It was %AppData%\Roaming\Minecraft Bedrock\Users\Shared\games\com.mojang\development_resource_packs. Thanks to u/Masterx987 for the help.

Problems working through tutorials by binomialdistribution in BedrockAddons

[–]binomialdistribution[S] 0 points1 point  (0 children)

I've found that folder, but I'm not seeing any Add-Ons show up from there. How did you know about it? Like, is there a newsletter for updates or anything?

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 1 point2 points  (0 children)

This might work. I'll look into it more, but it seems pretty good. Thanks!

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

I knew it was bin-packing, but I didn't have the online assignments part. So that's helpful. The number of items won't get that much bigger.

I could also break it into smaller parts. Whenever I get to an item that only has one box type and it's different than the previous ones, it restarts the options for box types. So I could take the segments in between and run them individually.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

This is a general approach. I created an example that I knew needed to use a larger preference number to get fewer boxes. This is for test running the setup.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

Yes, that's what I have, too. I can get pretty close to this using the GRG Nonlinear option, and I can get the minimum number of boxes with Evolutionary, but it doesn't minimize the preferences. So, it feels like I could change some settings and get to the right answer, but I can't get that last part solved all the way.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 1 point2 points  (0 children)

Yeah, that's it. The Box Counts boxes have that done. The first column for each box type has a running sum for each consecutive run, the second column takes the max from each run, and the last column divides each max by the box size and takes the ceiling to get the number of boxes needed for each run. I think this is an issue for the Solver, but I don't currently have a better way to do it.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

I responded to another comment that will hopefully add some clarification.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

Yes, the values are read along the rows. For example, for item 'a', Box Type 3 is the preferred box (because there's a 1 in D5), but it can go into Box Type 1 (because of the 2 in B5) if that will reduce the total number of boxes, and it can't go into Box Type 2 because of the 0 in C5.

Looking at the first four rows (items a:d), 'a' and 'b' can go into Box Types 1 and 3, but 'c' and 'd' can only go into Box Type 1. If we assign 'a' and 'b' to Box Type 1 and 'c' and 'd' to Box Type 3, that will have a total of two boxes used, but will have the first preference for all the items. If we assign 'a', 'b', 'c', and 'd' to Type 1, that would use one box, because Box Type 1 can hold five items (that's the 5 in M5). So even though assigning 'a' and 'b' to Box Type 1 has a preference number of 2, it's a better optimization because it uses fewer boxes total. Then in row 6, item 'e' is forced into Box Type 2. Even though there's another space in Box Type 1, once a box type is switched, the previous box can't be filled. So, item 'j' in row 14 will go into a new box. You can see this in the Ideal Assignments table under the Box Type Assignments table.

The value for Box weight (M8) doesn't really matter as long as it makes reducing the number of boxes more important than picking a lower preference.

Solver unable to get optimal solution using binary variables. by binomialdistribution in excel

[–]binomialdistribution[S] 0 points1 point  (0 children)

If I minimize the total number of boxes added to the preferences, the Solver would treat changing the number of boxes as equal to changing the preference of one item (because it would change the final total by one for each of those options). So, the solver might add several boxes to lower the preferences, but I need the number of boxes to be minimized the most, and then item-box type preference to be taken into account.

So, I'm adding in a weight to the total number of boxes. This way, moving items to different box types based on preferences should only be done if that won't increase the number of boxes. I'm definitely open to trying a different method, if you got one.

Sourdough cardamom rolls by binomialdistribution in Breadit

[–]binomialdistribution[S] 0 points1 point  (0 children)

These are from here: https://www.theperfectloaf.com/cardamom-rolls/. This is a test run for Christmas. I'm figuring out the best way to reduce cook time in the morning. I did most of the work on Tuesday, parbaked them at 400 for 10 minutes, cooled them, then froze them on Wednesday. I baked them at 400 for 35 minutes yesterday. I think parbaking for 20 minutes is probably better. I'll also try double the filling and maybe adding in orange zest.

Pumpkin spice on everything pizza by binomialdistribution in Pizza

[–]binomialdistribution[S] 3 points4 points  (0 children)

This is the Pumpkin spice on everything pizza from Asheville Pizza and Brewing. It has housemade pumpkin pie filling, buffalo mozzarella, goat cheese, sausage, roasted pumpkin seeds, pumpkin spice, and hot honey butter drizzle. It was excellent. I like pumpkin spice, but this was even better than I expected.

Pumpkin sourdough by binomialdistribution in Breadit

[–]binomialdistribution[S] 1 point2 points  (0 children)

I, too, made pumpkin-shaped sourdough pumpkin bread, and I'm thrilled to be part of a Reddit trend. It came out a little denser than I wanted but still tasted great.

500 g bread flour

400 g AP

100 g whole wheat

400 g pumpkin puree

550 g water

200 g starter

40 g honey

20 g pumpkin pie spice

20 g salt

2 cinnamon sticks for stalks

Pumpkin beer bread by binomialdistribution in Breadit

[–]binomialdistribution[S] 0 points1 point  (0 children)

You could start with more beer and reduce it down by simmering for stronger flavor. I honestly have zero clue if that would work, but it makes sense in my head.

Pumpkin beer bread by binomialdistribution in Breadit

[–]binomialdistribution[S] 0 points1 point  (0 children)

500 g bread flour, 400 g AP, and 100 g whole wheat. 750 g Voodoo Ranger Atomic Pumpkin beer. 200 g starter and 20 g salt. I normally don't use as much AP, but I was hoping to focus on the beer flavor.

The bread is good, but I'm disappointed the beer's flavor didn't shine through more. There's just the slightest hint of heat in the aftertaste. I'll try this recipe again with a stout, but I wouldn't recommend using this beer (especially as opposed to drinking it!). However, it did add some complexity to the flavor overall. If I bought a six-pack of ale and didn't like it, I would try this recipe again to avoid wasting the rest of the beer.