## How can I speed up combat with a large number of enemies?

I’m DMing for a campaign where the player characters will sometimes face small squads of creatures, most recently six ground troops and two archers helping out. In this setting, these creatures dominate the land the PCs are in and have an organised military, hence squads of enemies.

Combat tends to go quite slowly, however. Eight enemies and three players means the players spend a lot of time waiting between their turns!

Without reducing the number of enemies in the encounter, how can I speed up combat when the players are fighting many enemies?

## How do I calculate a line segment that is a certain number of degrees from another line segment?

I have a line segment that is at an arbitrary angle in 3D space. I want to (in code) draw another line that shares an end point with the first line and has an angle of X degrees between them. The second line will partially overlap the first in the XZ plane.

## How to display the number articles with the same tag inside specific category

I am trying to display the tags that are inside of a specific category. I have this working properly but now I want to show the count next to each tag showing how many articles are in that tag. i.e

tag-name(4) 

I have something that is very close but the problem is that if I have two tags inside a category let’s say apples and oranges, both will show (2), because there are 2 tags in that category in general. I want it to show how many of each tag, like Apples(1), Oranges(2) Here is my code:

 <?php   query_posts('category_name=Health');    if (have_posts()) : while (have_posts()) : the_post();     if( get_the_tag_list() ){         echo get_the_tag_list(); echo"(";echo $wp_query->found_posts;echo")"; echo '<br>'; } endwhile; endif; wp_reset_query(); ?>  Many thanks in advance. ## Is machine epsilon the largest relative error in representing a number as a floating point number? Is machine epsilon the largest relative error in representing a number as a floating point number? There are so many definitions of machine epsilon. I’m starting to get confused. Isn’t the machine epsilon the smallest? ## Is a relational database with a dynamic number of tables a good design? I have a use case where I wish to create a table for each entity to which the underlying application that owns this entity will publish records. This table has a fixed structure, so if there are 5 such entities in my system, there will be 5 different tables with the same schema. The schema is generic with one of the columns in the schema as JSON for flexibility. I do not expect queries based on the fields in the JSON. I expect the following queries on each entity: 1. On the auto-increment id primary key column with LIMIT and OFFSET where I need to read X rows from the record with id Y. 2. On the creation date column with LIMIT X. I expect thousands of such entities to be created on the fly so in turn there will be thousands of tables in the database. In future when one of these entities have fulfilled their purpose, the table would be simply deleted. I expect most of these tables to have not more than 100 rows while there will be a few with at least 1M rows as time goes by. This design makes data easy to query as my application can determine the table name from the entity name. Is this a bad design? Is there a limit to the number of tables in a database in RDBMS (the above design is with Postgresql 11 in mind) keeping performance in mind? Should I use any different datastore to achieve this other than RDBMS? Any suggestions? ## Initially, any individual who needs to distinguish a wireless number ought to know ab Don’t: Put in a request with any organization promising “moment results” or “boundless phone queries” Manage any individual who has guaranteed anything for nothing, similar to “free mobile phone number hunt” Purchase anything without looking at costs extend from$45-$175 for a similar information. Additionally, pay special consumer phonelist mind to those contribution unthinkably low costs (we have seen various locales promising wireless quest information for$19.95 and even \$14.95- – none of them genuine.

Make a buy without comprehending what you’re getting. Never purchase from any individual who confesses to utilizing an information base (there is no phone data set!). Manage anybody that doesn’t unveil precisely what they will give. Numerous organizations make unclear guaranteed dependent on your desires, however convey just pointless data, for example, the name of the wireless transporter

Give a dime to any organization that doesn’t guarantee exact, checked data

All things considered, it ought to be noticed that nobody will furnish you with precise phone search data without doing a real examination concerning the number you give. Anybody in any event, alluding to a wireless number catalog, or any comparable garbage is attempting to scam you.

These are the more normal tricks and ploys. A comprehensive rundown of what to search for is past the extent of this article. Buyers are asked to utilize sound judgment when managing any electronic organization.

## False PayPal regarding new phone number message?

I have just received a message from a false PayPal email account – service@paypal.com (looks genuine, but it is NOT) – with the message "You added new phone number to your account".

Only I didn’t do that recently and the phone number in the email is not mine.

Here is a screenshot:

The email does not even have the footer information that genuine PayPal info have, starting with:

Further more, clicking on the link in the email navigates to diagnolita.lt!!!

So, watch out for this, everyone, it is a fraud, by all appearances.

## Reduce the number of final states for the given NSFA?

For the given NFA, how do you reduce the number of paths without adding $$\epsilon$$-transitions?

## Find the maximum number of valid cartesian coordinates

Given a list X containing m number of x coordinates and a list Y containing m number of y coordinates. The coordinate (x, y) is valid if and only if the difference between x and y is less than or equal to d. I need to find out the maximum number of valid coordinates. Here is my algorithm.

sort the list X in non-decreasing order sort the list Y in non-decreasing order for x in X:      for y in Y:          if abs(x - y) <= d:              let x match with y              remove x from X              remove y from Y 

Can this algorithm give me maximum number of valid pairs? If yes, is there any more efficient algorithm? The nested loop means the worst-case time is $$O(m^2)$$. Is there any log linear time $$O(mlogm)$$ algorithm for this question?