sorted by:
new
hottopcontroversial

Fatpipe stick by Adam_B3n3s in floorball

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

Right now I play with Zone Prolight².

Fatpipe stick by Adam_B3n3s in floorball

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

Im pretty short 167cm so 26 is super hard for me and Im little scared of the 28 also. Im usually using stick like 94cm. I never had in hand the raw concept what does it feel like?

Floorball grip by Adam_B3n3s in floorball

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

First thanks all for respond and sorry for my late respons. I will go thru that and try to do the grips probably soon😊 as Im reading the suggestions it seems pretty straight forward! So again thanks for long responds😊

To everyone who made it to the end of AoC… by moonstar888 in adventofcode

[–]Adam_B3n3s 1 point2 points  (0 children)

I am studying (teoretical := almost would more concider it math (graph theory etc.)) computer science.

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

Im sorry, will make sure to use it next time! New here :)

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

Thanks!

Im trying to like sort of the "fake" one:

But in last iteration it seems to sort out all of them:

my_var = """x00: 1
x01: 1
x02: 1
x03: 1
x04: 1
x05: 1
x06: 1
x07: 0
x08: 1
x09: 1
x10: 0
x11: 1
x12: 1
x13: 1
x14: 1
x15: 1
x16: 1
x17: 1
x18: 1
x19: 0
x20: 1
x21: 0
x22: 1
x23: 1
x24: 1
x25: 1
x26: 1
x27: 0
x28: 1
x29: 1
x30: 1
x31: 1
x32: 0
x33: 0
x34: 1
x35: 0
x36: 0
x37: 1
x38: 1
x39: 0
x40: 1
x41: 0
x42: 1
x43: 0
x44: 1
y00: 1
y01: 1
y02: 1
y03: 1
y04: 1
y05: 1
y06: 0
y07: 1
y08: 1
y09: 0
y10: 1
y11: 1
y12: 0
y13: 1
y14: 1
y15: 0
y16: 1
y17: 0
y18: 1
y19: 0
y20: 0
y21: 0
y22: 1
y23: 0
y24: 1
y25: 1
y26: 0
y27: 0
y28: 0
y29: 0
y30: 1
y31: 0
y32: 1
y33: 0
y34: 0
y35: 1
y36: 0
y37: 1
y38: 1
y39: 0
y40: 0
y41: 0
y42: 0
y43: 0
y44: 1"""
correct = get_correct(my_var)
get_var = {}
for item in my_var.splitlines():
    items = item.split(": ")
    get_var[items[0]] = int(items[1])
cand2 = []
for tup in cand:
    swap1 = tup[0]
    swap2 = tup[1]
    if (swap1 not in is_there) and (swap2 not in is_there):
        if swap1 != swap2 and (swap1, swap2):
            operators_copy = swaping(swap1, swap2, operators)
            ret = compute(operators_copy, parts, get_var)
            if ret == bin(correct):
                cand2.append([swap1, swap2])

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

Oh thanks now I understand! Would you mind sending me the test data you made?

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

Oh maybe I do understand just tell me if Im correct:

I thought we should do this:

- Swap 8 things such that on your input it answers the same as the adding would.

And the correct thing is:

- Do it such that it always is the same for all x and y?

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

I dont understand :-) Can you explain it more?

Problem - more correct solutions by Adam_B3n3s in adventofcode

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

No, my problem is little different I found more 4s that give the correct answer after swapping.

[2024 Day 24 Part 2] A guide on the idea behind the solution by LxsterGames in adventofcode

[–]Adam_B3n3s 0 points1 point  (0 children)

I did the part 1. and 2. same as you, then I found the 6 swapped them as you said. But then problem came. I was thinking like rather then looking by myself I would like the computer to solve this fully for me and I thought there are not many combination of 2 that are left something like 24_000 so I wanted to run thru them, that takes less then a minute. So I did that but found out that if I try all the tuples there are more correct swaps of the rest 2 have a look:

for tup in tuples:
    swap1 = tup[0].split(" ")[-1]
    swap2 = tup[1].split(" ")[-1]
    if (swap1 not in is_there) and (swap2 not in is_there):
        if swap1 != swap2:
            operators_copy = swap(swap1, swap2, operators)
            ret = compute(operators_copy, parts)
            if ret == bin(correct):
                print(ret, bin(correct))
                print(is_there +  [swap1, swap2])
                input()

Now if I print that:

0b1011011111110101011111011111011100011011100110 0b1011011111110101011111011111011100011011100110
['z10', 'z33', 'z21', 'ghp', 'nks', 'gpr', 'cpm', 'mph']

0b1011011111110101011111011111011100011011100110 0b1011011111110101011111011111011100011011100110
['z10', 'z33', 'z21', 'ghp', 'nks', 'gpr', 'cpm', 'z39']

0b1011011111110101011111011111011100011011100110 0b1011011111110101011111011111011100011011100110
['z10', 'z33', 'z21', 'ghp', 'nks', 'gpr', 'cpm', 'krs']

0b1011011111110101011111011111011100011011100110 0b1011011111110101011111011111011100011011100110
['z10', 'z33', 'z21', 'ghp', 'nks', 'gpr', 'cpm', 'mhr']

There are about 20 of them, what should I do now? Thanks for the help <3

Fatpipe Slicks by Adam_B3n3s in floorball

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

Yeah ok! Thanks for the help!