Cielingcat at [unixtime wrote:1184244437[/unixtime]]
WARNING: DO NOT READ IF YOU DON'T FEEL LIKE CRYING
Witch is one of the "reasonable" people on WotC.
I'm not crying. I'm laughing my ass off.
Moderator: Moderators
Cielingcat at [unixtime wrote:1184244437[/unixtime]]
WARNING: DO NOT READ IF YOU DON'T FEEL LIKE CRYING
Witch is one of the "reasonable" people on WotC.
FrankTrollman at [unixtime wrote:1184349921[/unixtime]]
If you roll a 20 on your attack roll, you hit your opponent. Therefore: If you miss your opponent, you did not roll a 20 on your attack roll.
- Rolls a natural 20.
- Fails Concealment Miss Check.
- Head Explodes.
Yeah... that was sort of the initial point. If you look back, the exchange was basically:NineInchNall at [unixtime wrote:1184822584[/unixtime]]Well, isn't that just because the initial conditional statement is unsound?
NineInchNall at [unixtime wrote:1184822584[/unixtime]]FrankTrollman at [unixtime wrote:1184349921[/unixtime]]
If you roll a 20 on your attack roll, you hit your opponent. Therefore: If you miss your opponent, you did not roll a 20 on your attack roll.
- Rolls a natural 20.
- Fails Concealment Miss Check.
- Head Explodes.
Well, isn't that just because the initial conditional statement is unsound?
Immortius at [unixtime wrote:1184844434[/unixtime]]
There are actually somewhat complex rules for analysing computer programs in order to derive logical statements describing their behaviour and ultimately prove their correctness, and most computer programs are a bajillion times more structured and less ambiguous than the D&D rules.
tzor at [unixtime wrote:1184865769[/unixtime]]It may only be initiutively obvious to a "casual observer" but a computer program is not a "rules set." It is an "instruction set." Rules exist and are all true at once. Instructions are followed in some sort of order.
D&D, oddly enough, is a combination of the two.
This is untrue. There exist both imperative and declarative programming languages. Take Prolog, for example, a declarative programming language that is framed in terms of logical rules with program outputs that can often be thought of as a byproduct of that proof. Some flavors of Prolog are seriously comprised of just Horn clauses. Rules-based programming not only exists but is a fascinating field.tzor at [unixtime wrote:1184865769[/unixtime]]It may only be initiutively obvious to a "casual observer" but a computer program is not a "rules set." It is an "instruction set." Rules exist and are all true at once. Instructions are followed in some sort of order.
Code: Select all
%The following rules can be used to determine if one list is the sorted version of another:[br]%Assert: An element is at the top of a list if it is the first element of the list. (A convenience.)[br]top([First|_],First).[br]%Assert: Inserting an element into an empty list results in a list of just that element.[br]insertadd([],Element,[Element]).[br]%Assert: An element belongs on top of an ordered list IF that element is less than the lists's top.[br]insertadd(List,Element, [Element|List]):-top(List,First), Element<=First.[br]%Assert: An element belongs in the body (but not top) of a list IF that element is greater than the list's top SUCH THAT the top belongs on a ordered body (sans itself) including that element.[br]insertadd([First|List], Element, [First|Result]) :- Element>First, insertadd(List, Element, Result).[br]%Assert: An empty list is sorted.[br]isort([], []).[br]%Assert: A particular result is a sorted version of a list IF the body of the sorted list (sans the top) is sorted and the top belongs on top.[br]isort([First|Rest],Result):-isort(Rest,Return), insertadd(Return, First, Result).
bitnine at [unixtime wrote:1184881952[/unixtime]](Hell, I could have even gone with a more common reference by siting SQL as an example of a declarative language. "SELECT * FROM Table;" is a desired result, not an instruction - the DBMS query optimizer is the one who generates instructions to meet that result in a manner outside the query language itself.)
Rob_Knotts at [unixtime wrote:1184914973[/unixtime]]THIS thread just started making me laugh/cry...
The Adventurer's Almanac wrote: ↑Fri Oct 01, 2021 10:25 pmNobody gives a flying fuck about Tordek and Regdar.
He comes back to life after dying. That's a bit higher than 3rd level magic.
Those stats were made by translating the ICE LotR modules into d20 rules. It was made by actually looking at the whole history of Middle Earth, instead of just rough assumptions based on reading the Lord of the Rings or the Hobbit once through.