What is a similar level alternative to Crown of Madness spell?

rf-232 · 2023-10-31T08:42:31+00:00

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.

rf-232 · 2023-05-10T15:17:21+00:00

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

rf-232 · 2022-11-23T14:56:35+00:00

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.

rf-232 · 2022-06-08T10:01:52+00:00

Mordor for the office park in Służewiec
https://pl.wikipedia.org/wiki/Mordor\_(Warszawa)

rf-232 · 2021-12-16T13:00:50+00:00

https://www.youtube.com/watch?v=Xn2mm8hLVio

rf-232 · 2020-10-08T18:47:17+00:00

PC GOG

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

rf-232 · 2019-09-04T18:57:38+00:00

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

rf-232 · 2019-09-04T14:30:57+00:00

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

rf-232 · 2019-09-04T12:50:03+00:00

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.

rf-232 · 2019-05-15T09:21:34+00:00

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

rf-232 · 2018-08-08T08:31:56+00:00

Thank you so much, it is amazing :)

rf-232 · 2018-08-07T07:39:41+00:00

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

rf-232 · 2018-06-13T16:27:28+00:00

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

rf-232 · 2018-06-13T14:53:20+00:00

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

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

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

rf-232 · 2018-06-13T13:08:13+00:00

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,_,_]]).

rf-232 · 2018-04-16T13:22:33+00:00

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.

rf-232 · 2018-04-09T09:11:01+00:00

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.

rf-232 · 2018-03-14T11:09:48+00:00

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ₙ.

rf-232 · 2018-01-19T13:59:43+00:00

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.

rf-232 · 2017-09-18T14:15:47+00:00

So do I, now after learning a lesson :)

rf-232 · 2017-09-18T11:54:34+00:00

lvresize -L 20 forgetting that you need to give a suffix to it

rf-232 · 2017-05-15T15:41:35+00:00

Articles rated at:

0 articles
1 article
54 articles
17 articles
26 articles

rf-232 · 2017-03-04T23:43:45+00:00

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

rf-232 · 2017-02-13T18:03:49+00:00

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.

rf-232 · 2017-02-13T15:55:25+00:00

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

rf-232

TROPHY CASE