Видео

And congrats to Cedric for continuing his hot streak - the only double perfect performance this past weekend!!

I didn't even read the instructions for that section during the competition - could tell it was too complicated and just moved on to section 5 ;-)

Nice video sharing great solution. Good Luck!

Nice solution! I can't remember when but I remember being nicely surprised by someone's solution on a previous case which was also to list out all the possible scenarios instead of dynamically calculating them - I wish I remembered which

Was a great experience to do this video, Thanks to Dim for that

wow nice job Cédric and thanks Dim!

Morgan is a wizard for simplifying things!! 👏🏼👏🏼

You could have opted for a voice-over? Which might have been harder than recording again 🙂

In the instruction, it says the bonuses of player1 get reset at the end of each game. But this rule seems not taken into consideration in your solution, so I wonder if the answer key to this case may be incorrect.

How did you do the brackets at 4:52 ? Something like HotShow.ahk might help display hotkeys.

I rarely comment on RUclips, but this video just floored me. Respect!

Thought I already posted this. Here is my level 4 code. I gave up on using Excel and just went with python: from functools import reduce CARDS=["A", "K", "Q", "J", "10", "9", "8", "7", "6", "5", "4", "3", "2"] cardPOINTS = [25,20,15,12,10,9,8,7,6,5,4,3,2] SUITS=["♠", "♣", "♦", "♥"] suitPoints=[3,5,7,9] def scoreCard(card): rank = card[:-1] suit = card[-1] val=cardPOINTS[CARDS.index(rank)]*suitPoints[SUITS.index(suit)] return val def kind(cards): same = [c for c in cards if c[0] == cards[-1][0]] if len(same) < 3: same = [] return same def run(cards): ranks = [c[0] for c in cards if c[-1] == cards[-1][-1]] ranks = [" 234567891JQKA".find(c) for c in ranks] seq = [ranks.pop(-1)] while seq[0]-1 in ranks: seq = [seq[0]-1] + seq while seq[-1]+1 in ranks: seq.append(seq[-1]+1) if len(seq)<3: seq = [] seq = [" 234567891JQKA"[s]+cards[-1][-1] if s>10 else str(s)+cards[-1][-1] for s in seq] return seq def getDeal(deal): points = 0 dealt = [] for c in deal: dealt.append(c) ranked = kind(dealt) suited = run(dealt) toRemove = set(ranked).union(set(suited)) scores = [scoreCard(c) for c in toRemove] if len(scores)>0: value = reduce((lambda x, y: x * y), scores) print(value) for c in toRemove: dealt.remove(c) points += value return points def remain(deal): points = 0 dealt = [] for c in deal: dealt.append(c) ranked = kind(dealt) suited = run(dealt) toRemove = set(ranked).union(set(suited)) scores = [scoreCard(c) for c in toRemove] if len(scores)>0: value = reduce((lambda x, y: x * y), scores) print(value) for c in toRemove: dealt.remove(c) points += value leftover = sum(scoreCard(c) for c in dealt) return leftover deal = xl("G284:BF284").values.tolist()[0] getDeal(deal)

Here is my level 5 recursive lambda: Level 5: I did use a recursive lambda: input is an array that consists of lana's current cell vstacked with the addresses of all the bananas. =LAMBDA(input, LET(bananas, DROP(input, 1), lana, INDEX(input, 1), banDist, BYROW(bananas, LAMBDA(a, _distance(a, lana, MAX))), "- Calculates distances to all bananas borderDist, MIN(_rowCol(lana) - 1, 41 - _rowCol(lana)), "- Distance to the border nearBan, MIN(banDist), "- Don't need this based on your video. ind, XMATCH(MIN(banDist), banDist), before, TAKE(bananas, ind - 1), "- All bananas before the nearest after, TAKE(bananas, ind - ROWS(bananas)), "- All bananas after the nearest newBananas, IF(ind = 1, after, IF(ind = ROWS(bananas), before, VSTACK(before, after))), target, INDEX(bananas, ind), newInput, VSTACK(target, newBananas), ans, IF(borderDist < nearBan, 0, 1 + _lana(newInput)), ans))

Bonus 1, if I was solving it in competition, I would NOT have added the markup, as the wording of the question implied to me that it wasn't supposed to include a markup, it asked for the cost to produce, whereas in lvl 1 it asked for markup value. Level 2, my first read I thought ALL mining cost energy, not just the uranium and mercury. Again, skim reading is an issue! My formula for lvl 2: =LET(stRow, AQ19, poss, TAKE(DROP(MINE, stRow - 2), 4), seq, HSTACK(CHOOSEROWS(poss, 1), IFERROR(reverse(CHOOSEROWS(poss, 2)), " "), IFERROR(CHOOSEROWS(poss, 3), " "), IFERROR(reverse(CHOOSEROWS(poss, 4)), " ")), mined, FILTER(seq, seq <> " "), toxic, SCAN(0, mined, LAMBDA(a,v, IF(OR(v = "☢", v = "🌡"), a + 1, a))), life, 100 - SCAN(0, toxic, SUM), spoils, TAKE(mined, 1, SUM(--(life > 0)) + 1), coins, XLOOKUP(spoils, minerals, values), SUM(coins)) For seq, I assumed that you would never need more than 4 rows. Level 3 messed me up by having the 25 as a string instead of a number. But, I wasn't on a timer, so I had time to fix it.

Thanks a lot for sharing your approach and techniques. You are truly inspiring!

great content, thx

I like your technique of FIND(LEFT( ), "SDT") that used to convert the Dart record to score. I will try that out. Thanks!

always so fascinating, I wonder how you manage to delete spreadsheets using keyboard shortcuts because I've really searched but can't find it

16:45 Love the _prev Lambda. It makes the miss-hit turn# count accurate. 👍👍

I was a bit stronger in this one than the afternoon session. I think the answers are wrong for section 5 starting in game 83 which throws off the rest of the games. It looks like the answers don't reset the purple car's special ability between games. I'm curious to see part 2.

Small brag: did this in 13 minutes, first time I am actually faster than you! I think that's due to the use of one cell solutions which is a bit less productive here. My heart sank when comparing the scores I saw that bonus 3 different: checked 3 times before finding out the last bit of the video!

1:11:55 The worst part is that I feel the same energy at that moment😂😭

🏆💻📊

I competed in this one. Took a quick look at level 1 and skipped it to go on to non-map based levels. I ended up solving level 1 manually as the first half all start from the same point. (I did this AFTER I completed all the other levels) Your reaction to level 3 was similar to mine, though I didn't have to solve it in competition. Thankfully this one was much simpler. Yes, level 4 seemed like basically the exact same as level 2 to me as well. You made it more complicated than I did. I simply subtracted 9 from the final shot as the player that wins will have 9 hits prior to the final hit that mean the turn doesn't need to increase. I used the exact same formulas as in lvl 2 except with -9 at the end. With my lvl 4, I changed the E0 to E10 on lvl 73. I find it bad that a person can win by placing their ship illegally! It didn't really affect my placement, but I think 82 should be a valid answer. I didn't find lvl 5 too bad, until I checked my score! I still don't know what I did wrong. My logic seems sound as I've looked it over multiple times, but I only got 3 levels correct. (The first 2 and a random one a bit later.)

You are a certified excel gangster

Are you using vba only to make custom formula or some other languages also

Good catch on the speed equation. Flipping the equation helped avoid decimals but created a whole world of other issues!

I guess furloughs might be measured in square seconds per metre

Love your content

The fact that tocol of the banana map already gives you things in the preferred order is a game changer, I made a huge let with sortby for absolute distance, then rows and columns when I really didn't need to! Very clever solution, I'm going to try and find some other solves for that one to see if there are other methods but your one was really good there!

Thanks for sharing this, very impressive!

Awesome idea for managing the mine! Still need to properly watch your structure for the cards, but I start suspecting one of the following: a) there is probably a significant shortcut to solve it or b) it was easier to do manually

12:27 This case was no way easy. 😅 Thank you for sharing!

That card case was no joke

*Hello and welcome!* 🏆💻📊📉 😎

Keep going

The haters spin was great - it disambiguated whether close friends also count as friends! Also am stunned into silence by the LET uses here which are amazing.

That was extraordinary to watch! You are so fluent with your lambda collection, it’s so cool to watch!

Very helpful as always! Thanks for sharing the other Excel Esports RUclipsrs too!

Thanks for the mention! The way you handled that time format was really impressive. I was also thinking about the percom lambda but I didn't save it. Might be one I add for next time. I think everything above the bottom locations was obvious from looking at the map so really you would only need to do the combinations of those bottom ones. I got to the step of having the grid with values of distance from every cell to every other cell but then just decided manually is easier! Just missed that taking the top one of the bottom set early was the way to go so that when you come up you just skirt around the edges of the wall. Makes so much sense now seeing the optimal order!

Awesome content

The correct answer to BQ5 is indeed 113. Unfortunately, nobody managed to solve this bonus question within 30min.

42:19 that's incredibly impressive 😮

Hello my friend 👋😄 📊📉💻

I observe that =SEQUENCE(10;;1;1)+SEQUENCE(;10;1;1) is similar with =MAKEARRAY(10;10;LAMBDA(r;c;r+c)) . Both can be part of Mid(). It is there any details of choosing Sequence() or is just momentum choice? Thank you!

I'm amazed at the _distFrom lambda. I didn't know you can use eta lambdas as inputs to a lambda... 👀

What if ‘_mostOf’ returns the most values? I used Index with row 1 and column 1 to get it. maybe you know how to modify it thanks for your help!

Mind blowing logics

Great Video, the Level 7 impressed me so much. I replaced matching pairs with a placeholder and also Pairs, that only contained my placeholder as well with a placeholder. so "()" became "oo" and "(oo)" became "oooo" and so on with each type of bracket. After that i searched for the different closing brackets and took the min, as my string was still the same length as in the beginning. but your solution is smart and elegant, just insane. you keep blowing my mind and I keep learning from you, thank you so much ☺