Shooting through a large creature

I was wondering if I could shoot through a large creature like the image below? enter image description here

On the right image, one of the players insists that a large creature shouldn’t be able to fill up the 10x10ft space, therefore should still be able to shoot through the large creature (orange) and hit the red for maybe 3/4 cover (+5 AC).

What do you guys think?

Matrices of Machine- or Arbitrary-Precision Real Numbers Error While Using Arnoldi for Large Sparse Matrix

I’m trying to use the built in Arnoldi method in Mathematica to compute the first 1440 eigenvalues of a large sparse matrix. After importing

Elements12 = NN /@ Uncompress[Import["Elements12.m"]] and applying the followings function

NN[{a_, b_} -> c_] := {a, b} -> N[c];

I define a sparse matrix

s = SparseArray[Elements12] 

which I’m able to nicely plot using MatrixPlot

MatrixPlot[s]. 

However when it comes to finding the first 1440 eigenvalues

Sort[Eigenvalues[s, -1000, Method -> "Arnoldi"]] 

I receive the error that “Method -> Arnoldi can only be used for matrices of machine- or \ arbitrary-precision real numbers” despite my matrix elements being machine presicion after applying NN. My matrix is 344640 by 344640 and has 5,300,000 non zero elements. Any help will be appreciated.

Queries on large database kill connection to the server, works with LIMIT

I’m trying to run queries on a large-ish database without killing the connection to the server.

I’m using Postgres 12.1 on a mac with 16gb of memory, and about 40gb of free disk. The database is 78gb according to pg_database_size with the largest table being 20gb according do pg_total_relation_size.

The error I get (from the log), regardless of which non-working query I run, is:

server process (PID xxx) was terminated by signal 9: Killed: 9 

In VS code the error is "lost connection to server".

Two examples that don’t work are:

UPDATE table SET column = NULL WHERE column = 0; 
select columnA from table1 where columnA NOT IN ( select columnB from table2 ); 

I can run some of the queries (the above one, for example) by adding a LIMIT of, say, 1,000,000.

I suspected that I was running out of disk due to temp files, but in the log (with log_temp_files = 0), I can’t see any temp files being written.

I tried increasing and decreasing work_mem, maintenance_work_mem, shared_buffers, and temp_buffers. None worked, the performance was about the same.

I tried dropping all indexes, which brought down the “cost” on some of the queries, but they still killed the connection to the server.

What could be my problem and how can I troubleshoot this further?

Additionally, I read that temp files from timed-out queries are stored in pqsql_tmp. I checked the folder, and it does not have files of significant size. Could the temp files be stored somewhere else?


The log file for running a failed query looks like:

2020-02-17 09:31:08.626 CET [94908] LOG:  server process (PID xxx) was terminated by signal 9: Killed: 9 2020-02-17 09:31:08.626 CET [94908] DETAIL:  Failed process was running: update table         set columnname = NULL         where columnname = 0;  2020-02-17 09:31:08.626 CET [94908] LOG:  terminating any other active server processes 2020-02-17 09:31:08.626 CET [94919] WARNING:  terminating connection because of crash of another server process 2020-02-17 09:31:08.626 CET [94919] DETAIL:  The postmaster has commanded this server process to roll back the current transaction and exi$   2020-02-17 09:31:08.626 CET [94919] HINT:  In a moment you should be able to reconnect to the database and repeat your command. 2020-02-17 09:31:08.626 CET [94914] WARNING:  terminating connection because of crash of another server process 2020-02-17 09:31:08.626 CET [94914] DETAIL:  The postmaster has commanded this server process to roll back the current transaction and exi$   2020-02-17 09:31:08.626 CET [94914] HINT:  In a moment you should be able to reconnect to the database and repeat your command. 2020-02-17 09:31:08.629 CET [94908] LOG:  all server processes terminated; reinitializing 2020-02-17 09:31:08.698 CET [94927] LOG:  database system was interrupted; last known up at 2020-02-17 09:30:57 CET 2020-02-17 09:31:08.901 CET [94927] LOG:  database system was not properly shut down; automatic recovery in progress 2020-02-17 09:31:08.906 CET [94927] LOG:  invalid record length at 17/894C438: wanted 24, got 0 2020-02-17 09:31:08.906 CET [94927] LOG:  redo is not required 

Displaying extra large images

I created a very large isometric render of a model of a town. I would like to display the image on the Web. What’s the best way of doing this? Should I host the single image or split it into tiles? Do either of these options affect render speed or download speed or memory usage in a browser? Thanks.

The image is 16384x8192px, 24-bits, 40MB, PNG format.

How to deal with different levels of initiative and propensity to overtalk in a large group?

I recently started playing with a large group of about 7-8 people. I noticed that, in our group, a couple of the people are very active: whenever there is a chance for the group to do things, it only takes them a second or two to come up with an action for their character and narrate it. On top of that, they are comfortable verbally jostling, interrupting, jumping in just after someone else is finished, and participating in overtalk, in order to take space for themselves in the conversation.

This would be fine with me–I can fight for conversational space just fine, and don’t mind so much when people do it to me–but a couple of the other players in the group don’t seem as willing to talk over people or to jump in with something as soon as the last person is done talking, and when they do talk it is at a much lower volume. For all I know they have as many great ideas bubbling around in their heads as the loud players, and are just waiting for their turn, but since they don’t loudly wade into the verbal fray, they don’t get to do anything.

In combat, there’s the initiative/turn-taking system that can solve this problem to some extent: even the quietest player at the table is guaranteed a turn and the DM’s attention. But out of combat, a couple of players who are always the first to speak up can go through several whole scenes without the quieter players’ characters doing anything.

I’m not sure if it has gotten to the point where any of the quieter players are bothered about it to the point where they are willing to speak up about it, but I’d like to prevent that from happening, or at the very least avoid being part of the problem.

As a player, how do I balance my desire to speak with the needs of our group’s quieter players to have room for them in the conversation? If I speak up I’m not giving the quieter players a chance to speak, but if I stay quiet, the other loud players will talk. As not one of the players who is getting talked over, is it my place to broach this with the DM? Or should I talk to the players I see as having the problem first? Or to the other louder players?

As a group, what methods can we use ensure that even our shyer/quieter/more reserved players have space to play, outside of combat?

RPG format for one-shot large group campaign [closed]

Can anyone recomend an RPG format that would allow me to run:

  • a one-shot (~6h) campaign
  • with about 15 inexperienced players
  • that would allow me to add some “morality” to the journey

They’d only be playing this one time, so I’m trying to find something that requires little to no character building, so we can straight up play, and where the characters have few rules and actions, so they don’t get as lost and it’s easy to understand.

I thought about running a murder-mystery campaign (and just give them some sort of powers/actions to solve through the mystery) but the only RPG I’ve experimented with is D&D, and it’s a bit hard to skim throuhgh all the different formats and trying to understand what would work.

How to approximate a large number of points – algorithm ideas

Assume there is a <0, 1> interval in 1D space with some points (nothing can be said about them). We can only use an operation of inputing a number (coordinate) and getting distances to the closest points on both sides of that given coordinate. An approximate number of all points needs to be found without counting all of them.

I need some ideas or clues on where to look for some similar problems to find an efficient algorithm.