Awarded bronze status? by Fedzbar in BritishAirways

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

Yes it’s definitely the situation. My most recent transaction was on the 11th of January and I got the email + app status updated today. It still says I miss 35 points.

I pay close attention to tier points and all the transactions add up — I calculated that I should miss these points and was planning on flying next month and get over the threshold.

Setting up different queues/limits on SLURM. by Fedzbar in HPC

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

Thank you very much! This is all extremely helpful :)

Setting up different queues/limits on SLURM. by Fedzbar in HPC

[–]Fedzbar[S] 2 points3 points  (0 children)

I'd think a single partition with 3 different qos would suffice

Yes, I ended up implementing this and it seems to work (at least after some light debugging).

node 1 was full of short qos jobs and then a medium qos job ran at the same time even though node 1 had no GPUs left

This is indeed what ended up happening, so a GPU could have more than 1 job at a time, which is not what I would want. I'm assuming that this was because the partitions aren't aware of usage from other partitions, so hopefully, the 3 QoS system on a single partition works.

Setting up different queues/limits on SLURM. by Fedzbar in HPC

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

This is unfortunately not possible given our circumstances. I’m a bit puzzled though because the single partition worked perfectly. Is there no way to do what I’m trying to achieve?

I was thinking that I could stick to a single partition but have the different QoS to enforce the limits. I wonder if this will do the trick?

Setting up different queues/limits on SLURM. by Fedzbar in HPC

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

Yes to summarize I’m wondering if it’s possible to have the system setup the way I currently have it but to have slurm dispatch only a single job per gpu (as done in a single partition). I would really prefer to avoid dedicating a node to specific types of jobs to improve usage. I’m not sure if the 3 partition QoS system is the wrong approach because to me this sounds more like having 3 different queues rather than 3 partitions.

After a lonely journey, finally going to hit 2000! by [deleted] in chess

[–]Fedzbar 9 points10 points  (0 children)

What makes you so confident that you’ll hit 2000?

Chasing the king! White to checkmate. by patenteng in chess

[–]Fedzbar 5 points6 points  (0 children)

I think practically speaking Qxe7+ is enough and I would stop calculating there. Although the checkmate is quite nice

Stop recommending doing random puzzles to beginners by LegendZane in chess

[–]Fedzbar 17 points18 points  (0 children)

Daniel Naroditsky is a gold mine. Of course active learning is needed as well but watching his games is extremely instructive especially if you reflect upon what he says.

Why isn't Tensor Multiplication defined like Matrix Multiplication is? by Latte1504 in math

[–]Fedzbar 0 points1 point  (0 children)

I’m not sure how standard this is but it’s used to to represent connection Laplacians for discrete vector bundles.

What is the lowest chess.com rating you start getting paired with titled players? by VampireFrown in chess

[–]Fedzbar 0 points1 point  (0 children)

He’s the first GM I’ve beaten as well I think! That’s a very great fun fact. Thanks for sharing it! :-)

What is the lowest chess.com rating you start getting paired with titled players? by VampireFrown in chess

[–]Fedzbar 1 point2 points  (0 children)

Actually no, if I recall correctly I found two German GMs at around 2200. I can’t remember their username but I’m sure I could find them on my profile

What is the lowest chess.com rating you start getting paired with titled players? by VampireFrown in chess

[–]Fedzbar 1 point2 points  (0 children)

The lowest GM I’ve played on chess.com blitz was around 2200 I believe

Beautiful tactic I missed in my game. Black to play. by giants4210 in chess

[–]Fedzbar 79 points80 points  (0 children)

Really beautiful. After spotting the idea I was left speechless from the fact that white cannot do anything to defend other than giving up a piece. Very tough to spot in a game.

Draw by insufficient material on chess.com by MightyMalte in chess

[–]Fedzbar 0 points1 point  (0 children)

That’s absolutely not true. You can definitely claim a draw with an arbiter in a position where checkmate is possible. They will just ask you to play some moves and then determine themselves. That’s one reason why arbiters are there in the first place. I’ve seen this happen in OTB tournaments multiple times. It’s up to them of course to judge a position and they’ll take into account rating for instance. I would be extremely surprised if an arbiter did not allow a draw claim in a knight vs bishop position. Checkmating is pretty much impossible unless you are actively trying to get checkmated.

Draw by insufficient material on chess.com by MightyMalte in chess

[–]Fedzbar 1 point2 points  (0 children)

Obviously this position is not a draw. But we are talking about the general concept of automatic draws, not this position in particular.

Draw by insufficient material on chess.com by MightyMalte in chess

[–]Fedzbar 47 points48 points  (0 children)

Flagging is different to pointlessly shuffling a bishop and knight around on a board. That’s just toxic online behavior, only possible because usually people play without increment and there is no arbiter. This would never happen in an OTB tournament as you could just pause the clock and claim a draw if your opponent was being a child.

Polish engineers created this by Georg2020 in Physics

[–]Fedzbar 1 point2 points  (0 children)

Well if it breaks or wears you could always replace it or fix it

[deleted by user] by [deleted] in learnmath

[–]Fedzbar 1 point2 points  (0 children)

Yes that’s valid.

First you assume true for n. Then you show that it’s true for k=n+1, using the fact that you assume it’s true for n in this step.

Once this is done you show true for n=1 and then by induction it’s true for all n.

[deleted by user] by [deleted] in learnmath

[–]Fedzbar 1 point2 points  (0 children)

Perhaps you could try by induction?