is there a pecil and paper type rpg that you can play by yourself? I am looking for an old style rpg that I can play by myself. is there such a thing? I was kinda thinking the munchkin series was like that
Looking for solo (one person) RPGs - do they exist? I am looking to find out if solo RPGs exist, and which you'd recommend.  I do not mean "one-on-one" 1 player + 1 GM games. I really mean "1 person."  Update: After receiving two (fine, up-voted) answers that indicate Choose Your Own Adventure solutions (which rocks with nostalgia), I should add that I'm not looking for simple linear decision tree gaming. A counterexample: I've got my own little creative-writing mini-game where I write out a story, but once every 5 sentences a series of dice-rolls forces my written sentence into something else, and I have to adapt as writer. Not really an RPG, but also non-linear.
To prove that $(\mathbb{P(N)},d)$ is a metric space To prove that $(\mathbb{P(N)},d)$ is a metric space where $\mathbb{P(N)}$ is the power set of $\mathbb{N}$.  And $d:\mathbb{P(N)}\times \mathbb{P(N)} \mapsto\mathbb{R}$ is defined by $d(A,B)=\begin{cases} 0, &amp; \text{if A} \Delta \text{B=}\emptyset  \\ m^{-1}, &amp; \text{where m is the smallest member of} A\Delta B \end{cases} $.   Attempt: $x \in P\Delta Q=(P-Q)\cup(Q-P) \implies x\in (P-Q) \text{ or } x\in (Q-P) $. But $(P-Q)\cap(Q-P)= \emptyset \implies x \in P \text{ and} \notin Q \text{ or }x \in Q \text{ and} \notin P. \ \ \ $    (*)  To prove the triangle inequality:  Take any three sets $A,B,C \subset \mathbb{P(N)}$ such that none of them are equal to another. Now,  $\min A \Delta B  =m_1, \min B \Delta C  =m_2,  \min A \Delta C  =m_3   $. To prove $d(A,B) \leq d(A,C)+ d(B,C)$. By (*), $m_1 \in A$ or $m_1 \in B$ but not both.   Again,  $m_2 \leq m_1$  or $m_3 \leq m_1$. Either way, we are done. When $A \neq B$ and either $B =C $ or $A=C$ (not both), we have respectively $A=C$ , $B=C$ . Which satisfies the triangle inequality. When $A=B$ it is evident.   Symmetry: We know $A \Delta B =B \Delta A$. $d(A,B)= d(B,A)$  Non-negativity and $0 \iff A=B$:   $d(A,B)=0 \iff A \Delta B= \emptyset \iff A \subset B \text{ and } B \subset A \iff A=B$. By definition $d(A,B) \geq 0$  Is this okay? Please verify. Bottom to top explanation of the Mahalanobis distance? How can I find out which process is locking a file or folder in Windows?  For instance, when trying to delete a folder, Windows reports this:     The action can't be completed because the folder is open in another program   Happens the same with a file, but how do I find out what program or application is currently using it and preventing me from deleting the file or folder? Finding the maximum likelihood estimator Find the MLE of the unknown parameter $\theta$ when $X_1,X_2,...,X_n$ is a sample from the distribution whose density function is: $$f_X(x) = \frac12e^{-|x-\theta|}, -\infty&lt;x&lt;\infty$$ What I did so far: $$\text{maximize }(\frac12)^ne^{-|x_1-\theta|-|x_2-\theta|-...-|x_n-\theta|} \\ \text{thus we want to minimize }|x_1-\theta|+|x_2-\theta|+...+|x_n-\theta|$$ Since $|x_i-\theta|$ is positive for all $i$, we want to solve for $\theta$ so: $$|x_1-\theta|+|x_2-\theta|+...+|x_n-\theta|=0$$ What do I do from here? How to Execute ShortCut From Command line in Windows 7 We came with a scenario where we have to use Shortcut file (.lnk), which is on the desktop, to execute an application for a headless device (i.e, without manual intervention).  Is there any way to execute it from Command prompt? Rest mass of the photon Why is the rest mass of the photon is taken to be zero?  If rest mass of the photon is non zero, then it leads to infinite energy of the photon (by $E=mc^2$ equation) and there is a violation of conservation of energy. Is this a reason?  Also, is there any thing called the relativistic mass of the photon? Why won't this command work? /summon Villager ~ ~2 ~ {Offers:{Recipes:[{buy:{id:371,Count:15},sell:{id:264,Count:4}}   I'm using this as a recycler villager, and I can't get the first trade to work. What's going on? I am reading Velleman's "How to Prove it", and in one example he proves  $\neg \exists x P(x)  \implies \forall x \neg P(x)$    in the following way:    Suppose $\neg \exists x P(x)$. Let x be arbitrary. Suppose $P(x)$. Since we have a specific $x$ for which P(x) is true, it follows that $\exists x P(x)$, which is a contradiction. Therefore $\neg P(x)$. Since $x$ was arbitrary, we can conclude that $\forall x \neg P(x)$, so $\neg \exists x P(x)  \implies \forall x \neg P(x)$    What makes me confused is the line in bold text, that is "Suppose $P(x)$". The reason is that he writes that he is doing proof by contradiction, but $P(x) \not\iff \neg\forall x \neg P(x)$. He is not treating all possible cases where $\forall x \neg P(x)$ is false by assuming $P(x)$, does he? So how can this be a valid proof by contradiction?    Edit: I deleted my first example since it was clearly not representative for the problem.  Edit 2: So the thing that I am opposing I guess is that $\neg \forall x \neg P(x)$ is not $P(x)$. And from what I have undestood, a proof by contradiction should use the negation of the consequent which I do not think that Velleman does. How do I connect Android devices to a WiFi AP and mobile data network simultaneously? Why do you need to know who I know on Google? I just created a SE account using my Google account. It said that it needs to "Know who you are on Google" (I guess my connections). As far as I know, SE is not a social network. I can't even follow other people (seeing when they post questions and answers).  What is the reason you need to know my Google connections?  This was on code review. Actually I have an account there, but for some reason it asked me to reconnect. This is the same on MSO; one sees this explained as "This app is requesting permission to associate you with your public Google profile": Dim screen past the minimum on Ubuntu My laptop's screen is far too bright at night, even if I set it to minimum brightness. I know that it is capable of being dimmer, because Windows will dim it further if I leave it idle. However, I can't figure out how to dim it lower to minimum on Ubuntu. Is there a way?  I've looked at  question, but it's talking about Windows. New "[tag:" syntax interferes with Markdown links SharePoint online REST: Get users profile properties I'm looking for some help with a REST call I'm attempting to make in SharePoint Online.  I'm doing an add-in that gives me the name, birhday and photo property of all user in user profiles    I tried with this code   var siteUrl = _spPageContextInfo.siteAbsoluteUrl;     Console.log(siteUrl);     $.ajax({         url: siteUrl + "/_api/SP.UserProfiles.PeopleManager/GetMyProperties",         method: "GET",         headers: { "Accept": "application/json; odata=verbose" },         success: function (data) {             console.log(data);         },         error: function(error) {             console.log(error);         }     });   but I only get current user profile properties, what I need is all user profiles properties for all users, how can i achieve that?  Thanks in advance! How to create a timer using tkinter? I'm working on a map in Bedrock Edition, and I need to have a command block at the end that says "Congratulations [player], you win!" Because it's a map, I cant just have it say a specific player's name, and I've seen maps that do exactly what I want mine to do. How do I format the command to allow this? It is well known that $\sqrt{2}$ is irrational, and by modifying the proof (replacing 'even' with 'divisible by $3$'), one can prove that $\sqrt{3}$ is irrational, as well.  On the other hand, clearly $\sqrt{n^2} = n$ for any positive integer $n$.  It seems that any positive integer has a square root that is either an integer or irrational number.        How do we prove that if $a \in  \mathbb N$, then $\sqrt a$ is an integer or an irrational number?      I also notice that I can modify the proof that $\sqrt{2}$ is irrational to prove that $\sqrt[3]{2}, \sqrt[4]{2}, \cdots$ are all irrational.  This suggests we can extend the previous result to other radicals.        Can we extend 1? That is, can we show that for any $a, b \in \mathbb{N}$, $a^{1/b}$ is either an integer or irrational? Identify a short story about post-apocalyptic household robots Media: Short story collection When I read it: 2011 but the story itself was much older (unsure how much) so this information only serves to clarify that it is by no means new. Plot summary: A futuristic home with household robots that help around the house (cooking, cleaning etc.), we learn about their routines and behaviour and later on it's revealed that nobody is home, in fact everyone is dead, and a description of the outside seems to imply post-nuclear apocalypse. Setting: I seem to remember snow or winter What it isn't: with Google I stumbled upon  by Ray Bradbury, and  is very similar, and the beginning made me think "Bingo!", but I do not remember there being a fire in the story I read, and I also remember a view from a briefly opened door, or window, of a snowy setting, so while it may be that I am confusing elements of another story, or my imagination, with There Will Come Soft Rains, I would still like to run this through here as a question, because I'm not convinced. Additional info: The short story collection had other short stories that I will include as I remember them, details will be fuzzy:   Meteor, by John Wyndham , by Charlotte Perkins Gilman A short story about a man who is driving a car and it is revealed in the end that he was dead the whole time , by Charles Dickens What is the best way to get a sine wave from a square wave? What is the difference between "citizen" and "denizen" Citizen: 1. A legally recognized subject ornational of a state or commonwealth, either native or naturalized. 2. An inhabitant of a particular town or city.  Denizen: 1. An inhabitant or occupant of a particular place.  Same thing? Explicit bijection between the successor of $\alpha$ and $\alpha$ (infinite ordinal). I would like to construct an explicit bijection from $\alpha^*$ to $\alpha$, where $\alpha$ is an infinite ordinal. I have been told a possible bijection would be:  \begin{equation} f(\beta) = \begin{cases} 0 &amp; \text{if } \beta = \alpha \\ \beta^* &amp; \text{if } \beta \text{ is finite} \\ \beta &amp; \text{otherwise} \end{cases} \end{equation}  I don't understand how this is constructed, or why it is a bijection.