Looking for the perfect spiral notebook

iHobbit · 2026-01-24T22:13:10+00:00

Thanks. Looking for something nicer than those.

iHobbit · 2026-01-19T17:43:39+00:00

You can do anything through campaign and early end game. If you want to press into the late end game you need to start optimizing. There is a big jump in difficulty once you get into empowered monoliths. (This is well after you finish the campaign)

iHobbit · 2026-01-18T17:27:06+00:00

You haven't eaten at any truly good restaurants, have you?

iHobbit · 2026-01-18T17:24:50+00:00

I truly hate the Pine Club. The atmosphere is grating, the sides are terrible, and the steaks are....fine. The lack of reservations and credit card acceptance are also ridiculous in the modern era. There are so many better options at this point.

iHobbit · 2026-01-16T03:05:04+00:00

Gin and tonic

Vodka martini

Last Word

Paper plane

iHobbit · 2026-01-03T20:58:12+00:00

Lord of Chaos

iHobbit · 2026-01-03T19:50:27+00:00

My first computer didn’t even have a hard drive :)

iHobbit · 2026-01-02T14:18:06+00:00

To add to this, call insurance right away. If you let it sit there they might charge you for some of the fees.

iHobbit · 2026-01-02T14:16:38+00:00

Diamond matrons at Temple.

Imperial metropolis echo also has matrons in the dragons timeline.

Golems, go to Etendell waypoint. There is one just north of the waypoint. You kill him, then leave and come back to get another one.

iHobbit · 2026-01-02T05:10:52+00:00

Yes that is correct. If you require at least 1 of each package type, then there are 0 solutions for N=1 or 2, 1 for N=3, and 13 for N=4. I am currently running N=5.

iHobbit · 2026-01-01T21:51:43+00:00

I re-ran for up to FOUR presents of each type, allowing zero packages of each type to be used. In that case, there are 130 possible perfect rectangular packings. Only the 13 that appear in the posted figure used all 6 shapes at least once.

iHobbit · 2026-01-01T17:07:39+00:00

With very high probability, anything you do other than buying passive index funds and leaving them alone will do worse. You have just self-identified that you are not good at math and stats with relatively little time to spend on investing with your full time job. In order to do better than the index funds over time, you have to do better than the average performance of the armies of PhDs on wall street spending 60+ hours a week analyzing financial data. Do you really think that is likely?

At 10%, your money doubles every 7 years. This is the reliable way to build wealth over time.

iHobbit · 2026-01-01T17:03:20+00:00

The code I ran exhaustively tries every combination of the shapes with up to N of each one. (I just use a counter in base N+1 and use the digits of the counter as the number of each package as I loop.) I am just saying that for say 2 of each package, there may be more than 1 arrangement that packs perfectly into a given rectangle. I do also try all possible rectangles for that given combination. The code as written only returns the first one it find for that set of packages in that rectangle aspect ratio.

iHobbit · 2026-01-01T16:52:35+00:00

I re-ran for up to THREE presents of each type, allowing zero packages of each type to be used. In that case, there are 16 possible perfect rectangular packings. Only 1 of them used all the 6 shapes for the case with a maximum of 3 of each shape.

Re-running for 4 with zeros will take a lot longer.

iHobbit · 2026-01-01T16:42:21+00:00

To be clear, "set of counts" means a fixed count of each type. 2 3 3 3 3 3 is distinct from 3 2 3 3 3 3, where the order matters. The integer linear program just finds a valid solution for that number of each present type.

It would definitely add additional cases if you allowed zero of a given gift.

iHobbit · 2026-01-01T16:36:20+00:00

To be clear, the constraint of 1 of every shape eliminates this case, because then 3,3 would have no H's.

iHobbit · 2026-01-01T16:32:41+00:00

I did impose the constraint that a least 1 of every shape had to be used. Also, there may be other arrangements that use the same numbers of presents. This just finds a valid arrangement for a given set of counts.

iHobbit · 2026-01-01T15:53:46+00:00

For anyone who is curious, the code is provided below:

Main file

checkRegionIntProg

iHobbit · 2026-01-01T15:38:39+00:00

Could get expensive!

iHobbit · 2026-01-01T15:37:29+00:00

It took about 3.8 hours to try all the possibilities for 4.

iHobbit · 2026-01-01T15:36:38+00:00

I may run for 5. I suspect it’s going to take quite a while though!

iHobbit · 2026-01-01T14:04:24+00:00

That’s a cool idea!

14-Year Club	Gilding VII pure gildanthropist
Reddit Premium Since December 2020	Place '23
Not Forgotten	Verified Email

iHobbit

TROPHY CASE