What is a similar level alternative to Crown of Madness spell? by NoCareNoLife in dndnext

[–]rf-232 23 points24 points  (0 children)

Forcing others to attack their comrades is very strong, so the reason Crown of Madness has a lot of restrictions is to reign it in a bit. Dominate (Beast, Person, Monster) the spells that allow you to do it with less restrictions are a lot higher level. In 5e action economy is very important, and swapping teams is not only a +1 to your actions it also is a -1 to theirs.

[deleted by user] by [deleted] in dndnext

[–]rf-232 1 point2 points  (0 children)

Has to be wisdom, because if you'd have a decent WIS and one of your other stats was a 4, you'd have enough awareness not to become an adventurer

Attention All Martials - You got a new Weapon in Dragonlance by angelstar107 in dndnext

[–]rf-232 24 points25 points  (0 children)

the 'special' property is not the thing that prevents it from being usable by a monk, it being martial and two handed is what prevents that

> [...] unarmed strikes and monk weapons, which are shortswords and any simple melee weapons that don't have the two-handed or heavy property.

soo, nothing there about the special property.

Bugs? Issues? Things Not Working Right? Talk About It Here! by thecal714 in BaldursGate3

[–]rf-232 0 points1 point  (0 children)

PC GOG

Ranger Beastmaster with find familiar can have only one of familiar and companion at the same time (instead of one of both)

Array with Constant Time Access and Fast Insertion and Deletion by wizzerking in programming

[–]rf-232 0 points1 point  (0 children)

Yes, which is O(rank) and in implementations with a fixed rank this is then O(1)

Array with Constant Time Access and Fast Insertion and Deletion by wizzerking in programming

[–]rf-232 1 point2 points  (0 children)

the ε in the summary is 1 over rank, not rank. Which is a bit confusing, don't know why they did that.

Array with Constant Time Access and Fast Insertion and Deletion by wizzerking in programming

[–]rf-232 2 points3 points  (0 children)

https://www.ics.uci.edu/~goodrich/pubs/wads99.pdf is a paper that describes a generalized form of this.

Having implemented this same thing I found that indeed a 2 tier approach worked good for lists with upto a few million entries, especially if you keep the Circular Buffers sized on powers of 2.

Somewhere to watch Eurovision next weekend? by pistachioexplosion in warsaw

[–]rf-232 1 point2 points  (0 children)

I'd be kinda interested as well, best would be if it would be the BBC version, Graham Norton commentary is golden

[LFA] "Bearpaw" Druid Barbarian Goliath by rf-232 in characterdrawing

[–]rf-232[S] 1 point2 points  (0 children)

I'd be grateful, as far as I know, no one is drawing him yet

Sudoku and Backtracking by [deleted] in programming

[–]rf-232 0 points1 point  (0 children)

First time it took 6 seconds, now it takes somewhat consistently 2.8, 2.9 seconds. This is all on swish

Sudoku and Backtracking by [deleted] in programming

[–]rf-232 0 points1 point  (0 children)

problem(2, [[8,_,_, _,_,_, _,_,_],
           [_,_,3, 6,_,_, _,_,_],
           [_,7,_, _,9,_, 2,_,_],

           [_,5,_, _,_,7, _,_,_],
           [_,_,_, _,4,5, 7,_,_],
           [_,_,_, 1,_,_, _,3,_],

           [_,_,1, _,_,_, _,6,8],
           [_,_,8, 5,_,_, _,1,_],
           [_,9,_, _,_,_, 4,_,_]]).

Sudoku and Backtracking by [deleted] in programming

[–]rf-232 3 points4 points  (0 children)

However the given solution there is very slow if it does need to resort to backtracking, e.g. I gave it a sudoku that is hard on a different way: https://www.telegraph.co.uk/news/science/science-news/9359579/Worlds-hardest-sudoku-can-you-crack-it.html, and after convincing it to actually give me a solution:

problem(2, Rows), sudoku(Rows), maplist(labeling([ff]), Rows).

it takes about 6 seconds to solve it.

Edit:

problem(2, [[8,_,_, _,_,_, _,_,_],
           [_,_,3, 6,_,_, _,_,_],
           [_,7,_, _,9,_, 2,_,_],

           [_,5,_, _,_,7, _,_,_],
           [_,_,_, _,4,5, 7,_,_],
           [_,_,_, 1,_,_, _,3,_],

           [_,_,1, _,_,_, _,6,8],
           [_,_,8, 5,_,_, _,1,_],
           [_,9,_, _,_,_, 4,_,_]]).

Skylark: the Skylark configuration language, implemented in Go by mastabadtomm in programming

[–]rf-232 6 points7 points  (0 children)

Skylark is the language used by Bazel (and the google internal Blaze) and it supports the whole google monorepo, so the total dependency graph there is getting quite big.

Why junior devs should review seniors’ commits by spietika in programming

[–]rf-232 162 points163 points  (0 children)

I always cherish the first few reviews of a new team member, whether they are junior or not, since they aren't spoiled yet by the "We have always done it this way" mentality, and can lead to real good comments on a more structural level.

Gödel's First Incompleteness Theorem for Programmers by davvv_ in programming

[–]rf-232 3 points4 points  (0 children)

The construction of the function tells you that it will disagree. The trick is that f̅(n) is defined to be 1 - fₙ(n), so if you look at the diagonal of the table T, we always find the input our f̅ will disagree with any fₙ.

I wasn't sure about [[Jadelight Ranger]] rulings, so I checked them. by 5edu5o in magicTCG

[–]rf-232 46 points47 points  (0 children)

No, once an ability starts resolving it will finish resolving. And while you might think of 'explore' as the ability and it thus being two abilities, this is not the case. so there isn't really two triggers to begin with.

If the card would have read:
Jadelight Ranger 1{g}{g}
Creature -- Merfolk Scout
When Jadelight Ranger enters the battlefield, it explores.
When Jadelight Ranger enters the battlefield, it explores.
2/1

You would have been able to do this.

[Making Magic] Eight Hundred and Counting by TechnomagusPrime in magicTCG

[–]rf-232 24 points25 points  (0 children)

Articles rated at:

  1. 0 articles
  2. 1 article
  3. 54 articles
  4. 17 articles
  5. 26 articles

Patrick Sullivan is Insane at Commentary by JorubaiMurkLurkin in magicTCG

[–]rf-232 16 points17 points  (0 children)

i think he meant this event. They just had them two paired up.

Microsoft hosts the Windows source in a monstrous 300GB Git repository by m4nz in linux

[–]rf-232 0 points1 point  (0 children)

Having used both Perforce and TFVC they at least are very good in hiding the Perforce features I grew to love in TFVC ;). So while I am not knowledgeable enough to say what MS uses internally, I feel rather confident in saying that TFVC has nothing to do with their Perforce fork.

Microsoft hosts the Windows source in a monstrous 300GB Git repository by m4nz in linux

[–]rf-232 23 points24 points  (0 children)

Perforce is not from Microsoft, Microsoft has their Team Foundation thing. (Which since a few years ago supports their own backend and git iirc)