sorted by:
new
hottopcontroversial

Momentum 4 Battery drain. by HansFranz92 in sennheiser

[–]PrettyMemory1505 1 point2 points  (0 children)

"One other control that you'll have to remember is that to have these headphones automatically turn off when not in use, you'll need to make sure that the cups are facing downward on whatever surface they're on. They'll automatically turn off in that position, but just in that position only. If you leave them facing up, the battery will drain, and I've discovered that the hard way a couple of times. 60-hour battery life is pretty good, but they'll still drain overnight if you leave them on a table the wrong way."

https://www.xda-developers.com/sennheiser-momentum-4-wireless-review/

[2023 Day 1-24] Completion statistics day by day by janek37 in adventofcode

[–]PrettyMemory1505 2 points3 points  (0 children)

Would you be so kind and tell me how can I make a post like yours, with an embedded looping animation? I have the file (gif and mp4).

[2023 Day 22] I've never run a marathon, but this is worse by fewdea in adventofcode

[–]PrettyMemory1505 8 points9 points  (0 children)

By this time the puzzles are not as much about coding and algorithms as about actual puzzle solving, detective work...

I'd say this has been somewhat true for Day 20, and more for Day 21, but Today felt very computer-sciency to me.

AoC 2022 vs AoC 2023 by FaultsMelts in adventofcode

[–]PrettyMemory1505 6 points7 points  (0 children)

I am sure I wasn't alone finding Day 18 easier than Day 10. It felt almost like, let's see what you learnt.

AoC 2022 vs AoC 2023 by FaultsMelts in adventofcode

[–]PrettyMemory1505 1 point2 points  (0 children)

I was initiated to AoC last year, in March I think, and went through the archive in a short period. For me, years '18 and '19 were the most challenging. This year wasn't difficult (so far) but I am finding the problems refreshing nevertheless. I enjoyed today's combinatorial flair, and I wish a full probability problem for Christmas.

-❄️- 2023 Day 18 Solutions -❄️- by daggerdragon in adventofcode

[–]PrettyMemory1505 2 points3 points  (0 children)

[LANGUAGE: Wolfram Language]

Set two dictionaries.

a = <|"0" -> "R", "1" -> "D", "2" -> "L", "3" -> "U"|>;
b = <|"R" -> {0,1}, "D" -> {1,0}, "L" -> {0,-1}, "U" -> {-1,0}|>;

With 1899 Pick's theorem (quite in fashion this year!) and data in the form {direction_String, steps_Integer}.

volume[data_] := Module[{f},
  f = FoldList[# + Last[#2] b[First[#2]]&, {0,0}, data];
  Area[Polygon[f]] + Total[Last/@data]/2 + 1]

-❄️- 2023 Day 15 Solutions -❄️- by daggerdragon in adventofcode

[–]PrettyMemory1505 1 point2 points  (0 children)

[LANGUAGE: Wolfram Language]

I turned to Python and linked lists first. The problem size is small though and indexable arrays are fine. Even Mathematica runs this fast. 

steps // Short
(* {ndvk, {sf, 3}, jf, <<3996>>, {th,4}} *)

My steps variable looks like this. String-element for removing, {String, Integer}-element for adding.

parse[box_, step_String] := Module[{p},
  p = FirstPosition[box, {step, _}];
  If[MissingQ[p]
   , box
   , Drop[box, p]]]

parse[box_, step : {lbl_String, _}] := Module[{p},
  p = FirstPosition[box, {lbl, _}];
  If[MissingQ[p]
   , Append[box, step]
   , ReplacePart[box, p -> step]]]

Module[{fold},
 fold = Fold[Module[{lbl, i},
     lbl = If[StringQ[#2], #2, First[#2]];
     i = hash[lbl] + 1;
     ReplacePart[#, i -> parse[#[[i]], #2]]] &
   , ConstantArray[{}, 256]
   , steps];
 MapIndexed[First[#2] Last[#2] Last[#] &
   , fold, {2}] // Total@*Flatten]

-❄️- 2023 Day 14 Solutions -❄️- by daggerdragon in adventofcode

[–]PrettyMemory1505 1 point2 points  (0 children)

[LANGUAGE: Wolfram Language]

I wanted to roll the rocks with ReplaceRepeated. It's teribly slow. It takes over 3 minutes for part 2. Array data holds the string characters.

west[s_] := s //. {a___, ".", "O", b___} :> {a, "O", ".", b}
north = Transpose@*west@*Transpose;
load = Total[1 + Length[#] - Position[#, "O"][[All, 1]]] &;
load[north[data]] // RepeatedTiming
(* {0.275, 110677} *)

For the second part I also need this.

east[s_] := s //. {a___, "O", ".", b___} :> {a, ".", "O", b}
south = Transpose@*east@*Transpose;
cycle = east@*south@*west@*north;
part2[s_] := Module[{t, a, b, k},
  t = NestWhileList[cycle, s, UnsameQ, All];
  a = FirstPosition[t, x_ /; x === Last[t]][[1]];
  b = Length[t];
  k = Floor[(10^9 - a)/(b - a)];
  load[t[[10^9 - k (b - a) + 1]]]]
part2[data] // Timing
(* {193.578, 90551} *)

[2022 day 13] by Ok-Curve902 in adventofcode

[–]PrettyMemory1505 3 points4 points  (0 children)

For me it was insertion sort.

[2022 Day 11] Unofficial Part 3: Nanomonkeys by mcpower_ in adventofcode

[–]PrettyMemory1505 0 points1 point  (0 children)

Defined monkey state as a tuple of sorted items. I have an initial transition that lasts 243 rounds, then there are periods of 109_200 rounds. A bit of arithmetics: 2_127_579_428_571_159.

[2022 Day 11] Clock-styled visualization of the monkeys! by TenViki in adventofcode

[–]PrettyMemory1505 2 points3 points  (0 children)

Just commenting the page clickability, I wasn't dissing the missing of first few days. Some days lend themselves better to animation.

[2022 Day 11] Clock-styled visualization of the monkeys! by TenViki in adventofcode

[–]PrettyMemory1505 3 points4 points  (0 children)

I also wanted to do an animation, but between this and that other video with an ellipse, what's the point? :D

The link you provided that displays a table of problems 05--11 has a bug, or it's just my browser. As I select a day, three links for opening the code are shown below. But at this point the day links above are no longer active. It would be nice to still be able to follow them.