Example:   Player 1 uses the ready action to do something when something happens (unimportant) Goblin, decides to charge across the battlefield and attack Player 2, but happens to cross paths with Player 1 possibly provoking an opportunity attack (here lies my question)   Could Player 1 decide to ignore their readied action and use their reaction to attack the goblin? This would of course take up their reaction so they could no longer take their readied action when it triggers.  If so; let's say it is a fireball that was readied (or any spell), would Player 1 be required to drop the fireball spell? They technically cast it as part of their ready action, but I would understand if this would be a downside to using a reaction before their readied action triggered (maybe this should be another question, but please answer it anyway and tell me if I need to create a separate one so you can answer it there too :P).
Merle the Wizard is fighting enemies with his friends on a bridge. He wants to cast a spell on the BBEG, but they are currently out of range and so he uses his action to ready a spell for when the BBEG is in range.  However, before that happens one of Merle's friends is knocked off the bridge. Can Merle ignore the spell he had readied and use his reaction to cast feather fall?
I'm completing a problem set, one problem for which I literally have no idea what to do on. The graders would prefer to have a physical copy of the problem so I thought it best to include the ¯\_(ツ)_/¯ emoji as my answer, instead of something like "Dunno" or "No idea."  Option #1 is to include an image.  Beyond that I actually don't understand how this emoji works. The middle character is Japanese kana "tsu" and proves problematic - TeX wants it in math mode then renders "?" when it is. From this  on Bayesian Least Mean Square estimation:  $$\mathbf E\left[(\Theta -\hat\theta)^2\right] = \rm{var}(\Theta -\hat\theta) + \left(\mathbf E[\Theta -\hat\theta]\right)^2 = \rm{var}(\Theta) + \left(\mathbf E[\Theta -\hat\theta]\right)^2$$  which is to say that $\rm{var}(\Theta -\hat\theta) = \rm{var}(\Theta)$.  I would like to ask how that comes about?  Thanks.  $\Theta$ is the random variable being estimated, and $\hat\theta$ is a constant estimate. Do you "gain" your 1st level? What happens when a creature enchanted with Soul Link would deal lethal damage to a player? Player A has 3 life left. Player B attacks with a  that has been enchanted by Player A's . Does player B win, or does nothing happen?  On the one hand, "whenever" makes it sound like the trigger (dealing damage) and the effect (healing damage) happen simultaneously.  On the other hand, combat damage doesn't go on the stack, while most other things do. So, possibly the combat damage is dealt, state-based actions are checked, and now it's too late for the Soul Link effect to heal player A.  If anyone knows which way is correct, my thanks! What to put in "affiliation" field when submitting paper without affiliation? Recently my paper is reviewed (by a professor from independent third party) and accepted by a journal. But, my employer allows me to publish this paper only without its name there.  Publishing house is expecting affiliation for each author, i.e. I can not leave affiliation as blank.   What should I write as the affiliation? Delete with Left Join in Oracle 10g Should I use 'or' or 'nor' after a negative statement? This document does not cover the SDK interfaces nor any other reference material.   I think the above is correct, but my grammatical checker in Microsoft Word underlines nor and suggests or. Why? Classic Fantasy with characters from the real world I read this book about 6-8 years ago, and it was already slightly old at that point. The key parts were that the characters were all from Earth (America, if I remember correctly - one character internally monologues about remembering exactly how many steps it takes to get to a specific beach from his house, and while I don't remember the beach name, I remember thinking it was American) and woke up in a fantasy world, scattered about, and not remembering where they come from for quite a while.  Each abductee is wearing a bracelet with (what I remember as) polyhedral dice, although they aren't named that I think I inferred it from the description, and at some point they start using them as a form of magic. They find out that they were all abducted by a wizard so they go to find him. I can't remember what happens next, other than that eventually they find him and in a later book in the series (that I only saw the blurb of) they go back to his castle.  I think the book might be called "______ Keep", and am fairly certain the later book in the series is called "Return to ______ Keep".  I'd really appreciate it if someone who knew the title could tell me - it's like an unscratched itch at the moment, and I'd love to read it again! Nsolve gives solutions with a small complex part which can't be eliminated by chop command "OpenID 2.0 for Google Accounts is going away"; will this affect Stack Exchange? Where did the disco repos go, or what is going on? I am wondering if my proof is correct? Thank you for whoever willing to take a look at it for me.     Proof $\liminf E_k \subset \limsup E_k $   If $\{E_k\}_{k=1}^\infty$ is a sequence of sets, we define \begin{align*} \limsup E_k &amp; = \bigcap_{j=1}^\infty\left(\bigcup_{k=j}^\infty E_k\right)\\ &amp;= \bigcap_{j=1}^\infty(E_j \cup E_{j+1} \cup \cdots)\\ &amp;= (E_1 \cup E_2 \cup \cdots) \cap (E_2 \cup E_3 \cup \cdots) \cap \cdots. \end{align*}  Therefore, $\limsup E_k$ consists of those points in $\mathbb{R}^n$ which belong to infinitely many $E_k$. \begin{align*} \liminf E_k &amp; = \bigcup_{j=1}^\infty\left(\bigcap_{k=j}^\infty E_k\right)\\ &amp;= \bigcup_{j=1}^\infty(E_j \cap E_{j+1} \cap \cdots)\\ &amp;= (E_1 \cap E_2 \cap \cdots) \cup (E_2 \cap E_3 \cap \cdots) \cup \cdots. \end{align*} Therefore, $\liminf E_k$ consists of those points in $\mathbb{R}^n$ which belong to all $E_k$ for $k \geq k_0$.  Now consider $x \in \liminf E_k$, then $x \in E_1 \cap E_2 \cap \cdots$, or $x \in E_2 \cap E_3 \cap \cdots$ and so on, that is to say, $x \in E_{k_0} \cup E_{k_0+1} \cup \dots$ for some $k_0$. More specifically, $x \in E_k \forall k \geq k_0$. Therefore, $x \in (E_1 \cup E_2 \cup \cdots) \cap (E_2 \cup E_3 \cup \cdots) \cap \cdots$, so we showed $x \in \limsup E_k$. Is it "a SSD" or "an SSD"? Possible Duplicates:             Since SSD (solid-state drive) is pronounced es-es-dee, I'm wondering whether one should write "an SSD" or "a SSD". Saying "a SSD" out loud feels a bit off... Found the alternative form: $\sum _{k=1}^\infty ((1-\frac{1}{k})^{k})^k$. Tried various criteria, no luck so far. Multiple runnable classes inside JAR, how to run them? JavaScript curry: what are the practical applications? I don’t think I’ve grokked currying yet. I understand what it does, and how to do it. I just can’t think of a situation I would use it.  Where are you using currying in JavaScript (or where are the main libraries using it)? DOM manipulation or general application development examples welcome.   mentions animation. Functions like slideUp, fadeIn take an element as an arguments and are normally a curried function returning the high order function with the default “animation function” built-in. Why is that better than just applying the higher-up function with some defaults?  Are there any drawbacks to using it?  As requested here are some good resources on JavaScript currying:    Crockford, Douglas (2008) JavaScript: The Good Parts  (Takes a detour into ML so skip the whole section from “A crash course in ML” and start again at “How to write curried JavaScript”)    (Mr. Resig on the money as per usual)    I’ll add more as they crop up in the comments.    So, according to the answers, currying and partial application in general are convenience techniques.  If you are frequently “refining” a high-level function by calling it with same configuration, you can curry (or use Resig’s partial) the higher-level function to create simple, concise helper methods. Yield return from a try/catch block Let   consider   a  square $10\times 10$   and  write  in  the   every   unit  square    the   numbers   from  $1$  to  $100$   such  that   every  two   consecutive  numbers  are  in   squares   which  has  a  common edge.  Then  there  are  two  perfect  squares   on  the  same line  or  column. Can  you   give  me  an  hint? How  to  start? Add new alias to Gmail without SMTP (forwarding-only address) Why is Ubuntu using so much memory? I have just turned on my PC and have two applications running; Thunderbird and Firefox. Whatever else is running is part of Ubuntu's feature set (as well as a few indicators).  This has been ongoing for weeks, so I'm not sure if it's normal behaviour or not.  Right now, my memory usage indicator says that Ubuntu is using 41% of my 6GB of RAM. I haven't even opened Gimp or my other day-to-day things. I'll be buying another 6GB of RAM, this week, so that I don't run out when using Gimp or Openshot, for example.  An overview of my running applications shows that Nautilus is using the most, yet it isn't even open. This seems a little excessive, or am I missing something?