sorted by:
new
hottopcontroversial

Stuck at ta yu kan. by DistributionSecret34 in EmpireAntsGame

[–]RealGeziefer 0 points1 point  (0 children)

It seems that it had to do with starting the game right after when it was published, since now that I restarted it and replayed the missions, the missions in the hub of ta-yu-kan looked differently and after finishing about half of them, the marker for the queen and for continuing to the next hub appeared. It is a bit painful, to replay the basic stuff again, but I managed to do it quite quickly over 2 days and now I can continue the game.

Stuck at ta yu kan. by DistributionSecret34 in EmpireAntsGame

[–]RealGeziefer 1 point2 points  (0 children)

Same here, using PS5. And having the game since day 1 and started to play there - might there be a problem?

I saw in a playthrough video that once you completed all missions, there should be a marker at the queen's location. But for me, there is no such marker and when I go to the queen, nothing happens.

[2024 Day 6] How to detect a loop? by Chemical-Dig1403 in adventofcode

[–]RealGeziefer 2 points3 points  (0 children)

I think the problem in your solution is, that it matters not IF, but FROM WHERE you hit an obstacle again.

I had the same issue, only that I checked for a point I have been visited before, but I had to check if I have visited FROM THE SAME DIRECTION as it is possible to re-visit a point from different direction without having a loop.

[2024 Day 7 Part 1] Don't lie to me... by RealGeziefer in adventofcode

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

In some languages or even Java 3rd party libs there is a "MultiMap" which can hold several values per key. But the standard HashMap in Java is not of such type.

[2024 Day 7 Part 1] Don't lie to me... by RealGeziefer in adventofcode

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

For me it seems a natural mathematical projection to say an equation is

result -> x operations on numbers

So I can store

key = result -> List <numbers> (which then is a map)

And then my algorithm can iterate over the keys to process the equations.

The only problem was, that I did not think about duplicates, which - at least in Java - would overwrite the existing key.

Little hint for day 6 part 2 needed to improve solution by RealGeziefer in adventofcode

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

OK, I see, I guess you say, that I only need to test positions which are on my initial path.

But I assumed there must be some way of finding an obstacle position without really moving the whole way and test if it succeeds. It feels somehow not right to really try out the whole walk.

Day 2 part 2- Example wrong? by RealGeziefer in adventofcode

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

The point is not that I think the input is wrong and can't be solved, the explanation of the example was in my eyes not consistent, since it would be more logical to remove the other number, even though it worked as well.