How to extend Pathfinder point buy to scores below 7?

In Pathfinder point buy, ability scores of lower than 7 (before adjustments from race) may not be bought with point buy.

What would be a balanced price for such low ability scores?

I am looking for personal experience from people who have done such an extension, or for a reasonably accepted view in the character optimization community.

Motivation for the question: How likely is to roll elite array or better with 3d6 in order?

In particular, I am not worried about players creating horrible malformed monsters with only threes and eighteens as their ability scores.

The question Is it allowed to buy ability scores lower than 7? addresses whether buying low ability scores is allowed (no), which is not the question here. The answer also argues that allowing buying such scores is a bad idea. My use case is very different – I want to have a method of measuring how good or bad ability scores are, and allowing anyone to buy them is not an issue here.

Is a tiny creature with the feat Blades Above And Below able to flank?

I have an idea for a Fighter Eldritch Guardian (F-EG) archetype and, for fluff, I want to have an Azata Lyrakien (a tiny outsider) as a familiar (by the improve familiar feat).

At level 2, the F-EG gains the ability to share combat feats with his familiar due to Share Training.

The feat Blades Above And Below (combat and teamwork feat) allows to flank an enemy as long as you are in melee and threaten it no matter their position. But tiny creatures can’t flank. Now, as far as I know, if the tiny familiar is in the enemy’s square, it threatens it. The rules does not say that the creature has to have the ability to flank the creature, just that it has to threaten it to flank it. Am I missing something or is this an opportunity for my familiar?

Share Training: … it can use any combat feat possessed by the eldritch guardian…

Blades Above And Below: When you and your ally who also has this feat threaten the same enemy, you’re both considered to be flanking that enemy, regardless of your actual positioning.

I’m only interested in PF Society legal related answers.

Hi Could someone please advise on how i can rectify the below problem. Thanks in advance!

Fatal error: Uncaught Error: Class ‘WP_Block_Type_Registry’ not found in /home/georgemohan/public_html/pubconvention.com/wp-includes/blocks.php:27 Stack trace: #0 /home/georgemohan/public_html/pubconvention.com/wp-includes/blocks/archives.php(124): register_block_type(‘core/archives’, Array) #1 /home/georgemohan/public_html/pubconvention.com/wp-includes/class-wp-hook.php(287): register_block_core_archives(”) #2 /home/georgemohan/public_html/pubconvention.com/wp-includes/class-wp-hook.php(311): WP_Hook->apply_filters(NULL, Array) #3 /home/georgemohan/public_html/pubconvention.com/wp-includes/plugin.php(478): WP_Hook->do_action(Array) #4 /home/georgemohan/public_html/pubconvention.com/wp-settings.php(549): do_action(‘init’) #5 /home/georgemohan/public_html/pubconvention.com/wp-config.php(220): require_once(‘/home/georgemoh…’) #6 /home/georgemohan/public_html/pubconvention.com/wp-load.php(40): require_once(‘/home/georgemoh…’) #7 /home/georgemohan/public_html/pubconvention.com/wp-blog-header.php(13): require_once(‘/home/ in /home/georgemohan/public_html/pubconvention.com/wp-includes/blocks.php on line 27

I am not getting output for the below batch file as expected [closed]

I wrote the below mentioned test batch file… But while executing it, when I give input as "How are you" then the file automatically gets terminated.

@echo off echo Hi! echo Happy to be at your service 🙂 :start set /a A = How are you set /p help="How may I help you? " if /i %help% EQU excel (start excel) else (if /i %help% EQU %A% (echo I am good! Thanks for asking)) goto start

But, if I write…

@echo off echo Hi Sir! echo Happy to be at your service 🙂 :start set /a A = How set /p help="How may I help you? " if /i %help% EQU excel (start excel) else (if /i %help% EQU How (echo I am good Sir! Thanks for asking)) goto start

and when I give input as "How"… I get the output as expected.

The output that I get at this case is…

Hi! Happy to be at your service 🙂 How may I help you? how I am good! Thanks for asking How may I help you?

Kindly help me in solving this issue.

Does a character automatically fail one death save when they drop below 0 hit points?

Hey guys so I have a question regarding death saves and if anyone knows an official source that can determine this.

So according to my dms interpretation of the RAW, if an attack brings you below zero hit points, it not only knocks you unconscious but also inflicts an automatic failed death save from that same attack.

And I to this point was under the idea that the attack that brings you below 0hp as long as it doesn’t also do your max health in damage after the fact then you are simply unconscious. And then all damage received after that inflicts auto fail saves (crits inflicting 2)

Is my interpretation or my dms interpretation correct and is there an official source or creator that has spoken on the matter?

Get the maximum sum of n items below a threshold

Consider a modified Knapsack Problem where:

  1. The number of items to be included is fixed.
  2. The value of each item is equal to its weight.

Therefore, given a set of numbers, a threshold and the number of items to use (n), I want to get the subset of n numbers that produces the highest sum below the given threshold.

Having already asked this question a year ago and not being able to fully understand the given answers, this time I’m asking for something a little different. The dynamic programming solution to the 0-1 Knapsack Problem only became clear to me when I got to see the recursive approach first:

def knapsack(w, ws, vs, n):     # if num of items or weight left is 0 value is 0     if n == 0 or w == 0:         return 0     # if item doesn't fit return best val without item     if ws[n - 1] > w:         return knapsack(w, ws, vs, n - 1)     # otherwise, return max of best vals with and without item     include = knapsack(w - ws[n - 1], vs, w, n - 1) + v[n - 1]     not_include = knapsack(w, vs, w, n - 1)     return max(include, not_include) 

So, if I were to solve my problem using a recursive approach (for educational purposes), what would that look like? And optionally, how would it be translated to a dynamic programming solution?

Can one enter Leomund’s Tiny Hut from below?

In a session today we were camped out in a Leomund’s tiny hut and the DM determined that since it is described as a dome, the bad guys (Wraiths, so they are incorporeal) could enter the area from below. I went with it and it was a fun encounter, but I wondered what other people think about it. I can see two arguments.

His argument: It is described as a dome. So only the semi-spherical outside prevents things from happening. A dome doesn’t (necessarily) have a floor, they can enter no problem.

My argument: The intent of the spell seems to be to prevent baddies from coming in. The rest of the wording simply talks about the “area”, not a barrier.

Has anyone thought this through or seen a ruling anywhere?

Note: Given that I’m playing a 3-foot tall gnome, we decided that on subsequent castings I’d do two. One is the normal one and the other is an inverted on with a “floor” about five feet in the air, that extends into the earth. The overlap allows for protection.

What happens when a character fails to reject influence that would put a label above +3 or below -2?

The Labels in Masks are fixed between -2 and +3. From the rulebook:

If you ever need to shift a Label and can’t (because the Label is at +3 and would shift up, or is at -2 and would shift down), you must mark a condition, GM’s choice.

When a character with Influence over you tries to shift your labels, this can be prevented with the reject someone’s influence move, but:

On a miss, their words hit you hard. Mark a condition, and the GM adjusts your Labels.

What happens if someone would shift your labels outside the allowed range and you fail to reject their influence? Do you take two conditions?

Finding largest sum of $k$ elements below threshold

I was working on a project and am stuck in the middle unable to find an optimal method to solve this problem. Consider an array $ A$ of $ n$ elements. I have to choose $ k$ elements such that the sum of indices is maximal under the constraint of being less than a given element $ x$ . My approach for this is the naive $ O(n^k)$ algorithm, but this would take a lot of time for large $ n$ .

This is isn’t a homework problem.