Why won't the NPC move in? One of my NPC's constantly wants to move in and I have 3 rooms available but it won't settle down. The NPC's name is Reishi by the way.
Why won't Amanita move in and settle down? I keep getting an alert that Amanita would like to settle down. I have a house ready for them however they still won't move in. Who is this NPC and why won't they settle down?
What are the advantages/disadvantages of the new encryption feature in ubuntu 13.10 I'm in the middle of installing 13.10 and the Ubuntu page I was following on how to install from a USB stick says nothing about these two choices (on the Installation type screen):     1) Encrypt the new Ubuntu installation for security (you will choose a security key in the next step).      2) Use LVM with the new Ubuntu installation (this will set up Logical Volume Management. It allows taking snapshots and easier partition resizing)   I'm a writer using the computer for mostly writing ebooks but I also do all the things most people do: buy stuff online, online banking etc. I want my information to be safe but I don't want to overburden my system with security stuff either. And I've read a lot of the similarly themed questions here on the forum but they've all been about stuff more technical than I'm concerned about.   Can somebody please just tell me in real layman's terms about the implications of these two choices? Thank you. What is the best method of re-rendering a web page on orientation change? Is there any bidirectional 5v-3.3v level shifter? How to determine the optimal control law? Given the differential equation $$\dot x = -2x + u$$ determine the optimal control law $u = - kx$ that minimizes the performance index $$J = \int_0^{\infty} x^2 \, \mathrm d t$$  My approach was to find the state feedback $k$. But since the value of $R$ (positive semidefinite Hermitian) is not given, that means $R=0$. How do I determine the optimal control for this system where $R=0$? Confidence Interval Calculation I have temperature data of July 1991 to 2007, and wants to find the Confidence Interval at 95%, which distribution is best fit the data, Z or T. Please give me reason also.    minTemp = 14.4444, maxTemp = 38.3333, SizeofData = 527, (17 years) hist(July, 20), histfit(July, 20); Is there a built-in that removes duplicates from list in Python, whilst preserving order? I know that I can use a set to remove duplicates, but that destroys the original order. I also know that I can roll my own like this:  def uniq(input):   output = []   for x in input:     if x not in output:       output.append(x)   return output   (Thanks to  for that .)  But I'd like to avail myself of a built-in or a more Pythonic idiom if possible.  Related question: I have built my house in Minecraft PE, and I have a ton of fences and sticks, but I need to know how big of a perimeter I need to let me sleep at night? I'm preparing a new template for our students' projects based on memoir. All this projects are supervised (directed) by one or more professors so I would like to declare a command like \author but called \director.   This way the student can declare \director{My professor} and the template will place and format the name.   I would like to be like \author and not just a simple \newcommand because it can include affiliation, several names, etc.  I don't know where is \author declared, where should I look? What are some CD Ripping Programs you can use on Ubuntu? What are some CD ripping programs for Ubuntu? Can you list the Pros? What are the Cons? For each program there should be a screenshot, sources to install, and instructions to install and use. Previously, someone posted his/her proof of "every neighborhood is open" . I am focusing on the same statement, but it seems that my approach is different from his/hers. Could someone comment on my own proof? Here we go:  Let $X$ be a metric space and $p\in X$. Fix $r&gt;0$. Define a neighborhood around $p$ as $N_r (p)=\{q\in X| d(p, q)&lt;r\}$. Now, take $w = \frac{r}{2}$. Then, $N_w (p)\subset N_r(p)$. In other words, every point of $N_r(p)$ is interior. Therefore, $N_r (p)$ is open. Since $r$ is arbitrary, this proves every neighborhood is open.  Update:  Under my definition of "neighborhood," can I prove in this way instead: For all $m\in N_r(p)$, take $w=\frac{r−d(m,p)}{2}$. Then, $N_w(m)\subset N_r(p)$.   Update2  From the hints given in comments, I solve it:  Assume $m\in N_r(p)$ and $q\in N_w(m)$. Take $w=r-d(m, p)$. Then, $d(p, q)\leq d(p, m) + d(m, q)&lt; d(p, m) + r-d(m,p) =r$.   Thanks to @JoséCarlosSantos and @fleablood ! How to clean an E: drive (new Recovery drive since Windows 10 1803) on HP laptop This is intended to be a canonical question regarding possible endings of the game.  For each question, assume a single proper strike was made, and note where an improper strike would change the game outcome (beyond an additional point for the opponent).  If the Queen has been covered:     What happens if I pocket my last C/m and the Striker? What happens if I pocket my opponent's last C/m? What happens if I pocket my opponent's last C/m and the Striker? What happens if I pocket both players' last C/m? What happens if I pocket both players' last C/m and the Striker?     If the shot covers the Queen:     What happens if I pocket my last C/m and the Queen? What happens if I pocket my last C/m, the Queen and the Striker? What happens if I pocket my opponents' last C/m and the Queen? What happens if I pocket my opponents' last C/m, the Queen and the Striker? What happens if I pocket both players' last C/m and the Queen? What happens if I pocket both players' last C/m, the Queen and the Striker?     If the Queen is left on the board:     What happens if I pocket my last C/m, leaving the Queen? What happens if I pocket my last C/m and the Striker, leaving the Queen? What happens if I pocket my opponent's last C/m, leaving the Queen? What happens if I pocket my opponent's last C/m and the Striker, leaving the Queen? What happens if I pocket both players' last C/m, leaving the Queen? What happens if I pocket both players' last C/m and the Striker, leaving the Queen? Ok, so I have made a .tmx file for my first level, but I am unsure how I would load it into my game. Currently I am iterating through an internal array to set the blocks, but I need to know how to load the .tmx file into the code.  Here is my World.java:  import java.awt.Graphics; import java.awt.Graphics2D; import java.awt.Image; import javax.imageio.ImageIO; import java.io.*;  class World {     Image ground;     Block[] blocks = new Block[46];     int map[][] = {             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},         };     World() {         int enc = -1;         for (int i = 0; i &lt; map.length; i++) {             for (int j = 0; j &lt; map[i].length; j++) {                 if (map[i][j] == 1) {                     enc++;                     blocks[enc] = new Block(j * 32, i * 32, 32, 32, 1);                 } else if (map[i][j] == 2) {                     enc++;                     blocks[enc] = new Block(j * 32, i * 32, 32, 32, 2);                 }             }         }     } } Correct way to use include and includeonly when writing a large document like a thesis How to fully backup non-rooted devices? I changed my hostname, why is my bash PS1 prompt unchanged? Adding PDF (especially GeoPDF) to ArcMap as data? I receive a lot of PDF maps (vector, image, with georeference and without) and I am having to convert them to an image file before I can add them to ArcMap and georeference.    I can't see any obvious out-of-the-box utility that would allow me to add and georeference a PDF directly without having to convert to an image file first.   Any ideas?  I would prefer to add a PDF to map directly without any prior "pdf to image" conversion Why does a bezier curve twist when rotated? If I create a bezier curve and rotate it in edit mode it does not accordingly rotate the tilt of the handles which creates an undesirable twisting along the curve.  Here is an example using a bezier circle with a square used for a bevel object:   Here it is after being rotated 90° about the y-axis:   How do I prevent/fix this? I'm trouble with exercise 1.8 of Carroll's Space-Time and Geometry:     If $\partial_\nu T^{\mu \nu} = Q^\mu$, what physically does the spatial vector $Q^i$ represent? Use the dust energy momentum tensor to make your case.    First of all, since the momentum energy tensor of dust $T^{\mu \nu}=\rho U^\mu U^\nu$ is symmetric, one has the energy-momentum conservation law $$ \partial_\nu T^{\mu \nu} = \partial_\nu T^{\nu \mu}  =0.$$ A vector $Q$ is constant in any frame related by a Lorentz transformation, while this isn't the case for the components $Q^\mu$. But here $Q=0$ and hence $Q^\mu=0$ also for every component $\mu =0,\cdots,4$?   Even if a straightforwardly apply the equation: $$ Q^i = \partial_\nu T^{i \nu} = (\partial_\nu \rho) U^i U^\nu + \rho(\partial_\nu U^i)  U^\nu + \rho U^i(\partial_\nu  U^\nu ),$$ doesn't seems to yield something...   Is my first reasoning right ? Otherwise: can someone give me a hint ?  Thanks Finding the sum of series $\sum_{n=0}^∞ \frac{2^n + 3^n}{6^n}$