Keep results with Strife if my teammates keep the Strife

I’ll be directing a game of L5R for the first time and I have some questions about Strife at L5R 5e (the one by Fantasy Flight Games). I might have missed the answers in the core rulebook as I’ve been reading it jumping from one page to another, but I haven’t found the answers there.

Can I keep results with Strife while I’m Compromised (page 30) if I’m using assistance and my budies take Strife for me (page 26)?

The text regarding being compromised tells (emphasis mine):

A compromised character’s vigilance attribute (see page 36) counts as 1. Additionally, when making a check, a Compromised character cannot keep dice containing strife symbols (to a potential minimum of 0 kept dice).

However, the text in Using Assistance reads:

During Step 3: Assemble and Roll Dice Pool, if a char-acter making a check receives assistance from one or more others, the character making the check rolls one additional skill dice per assisting character who has 1 or more ranks of the skill in use, and one additional ring dice per assist-ing character who has 0 ranks in the skill in use. Each player whose character assists must describe how they are helping, and the GM decides if they can contribute.

At the GM’s discretion, during Step 4: Modify Rolled Dice, up to one advantage from one assistingcharacter can be applied.

Then, during Step 5: Choose Kept Dice, a character making a check with assistance may keep up to 1 additional die per assisting character.

Finally, during Step 6: Resolve Symbols on Kept Dice, each assisting character may choose to suffer 1 strife to negate 1 strife symbol on the check.

By RAW and due to the order of steps, it seems that a Compromised character cannot keep any dice with Strife symbols, but the last paragraph tells that the symbol is negated while being resolved, not ignored. I understand the order being like that so nobody takes Strife negating an unkeeped dice, but if the Strife symbol gets negated, should it be possible to keep it if another person takes the penalty?

Chances to roll a number of results greater than 5 on a number of d10s

I’m trying to figure out how to implement a dice roller function.

I would like to know the chance in % to get [1 to X] results of 6+ on [1 to 10] 10-sided dice. So, for example, I would like to know the probabilities of 5 10-sided dice resulting in 3 results of 6+ (this is just one set of 10-sided dice I’m curious about).

Thanks a lot for your help.

Tabled Value Function returns incorrect or no results

I recently learned of TVF’s and it seemed like it was exactly what I was looking for. I did my first attempt at one and it is not going well.

Here is my code:

USE [RMC_Tracker] GO /****** Object:    UserDefinedFunction [dbo].[TFV_Dashboard] 9:08:08 AM ******/ SET ANSI_NULLS ON GO SET QUOTED_IDENTIFIER ON GO    Script Date: 4/13/2020  -------------------------------------------- Author:    John Clark Create date: 4/12/2020 Description: Returns a recordset for the RMC Tracker  ALTER FUNCTION [dbo].[TVF_Dashboad] ( -- Add the parameters for the function here @CompDate datetime = NULL  ) RETURNS TABLE AS RETURN ( -- Add the SELECT statement with parameter references here SELECT    dbo.ACTIVE.RECORD_ID, dbo.ACTIVE.CMD_ID, dbo.ACTIVE.EQUIPMENT, dbo.ACTIVE.EquipDes,            dbo.ACTIVE.CASREP,dbo.ACTIVE.[UPDATE], dbo.ACTIVE.TYAST,                dbo.ACTIVE.STATUS,dbo.ACTIVE.JCN, dbo.COMMANDS.Trigrpah  FROM      dbo.ACTIVE INNER JOIN dbo.COMMANDS ON dbo.ACTIVE.CMD_ID = dbo.COMMANDS.CMD ID   WHERE    (dbo.ACTIVE. RECCLS = @CompDate) ) 

I call this Function from within MS Access via a Pass Through Query:

SELECT * FROM dbo.TVF_DashBoard(default) 

It returns an empty set. What I am trying to do is create a simple Function that allows me to return a table that can be toggle based on whether a field (RECCLS) is either Null or Not Null.

Any assistance would be appreciated.

Benefit of using pretty urls on search results with content Noindex?

Google doesn’t want thin content like search results pages to be indexed. So I use noindex on all those search results on my website.

Then is there a benefit using pretty urls like below.

Over this:

other then look and easy of use.


Does anyone know how to make the extra data, about the number of jobs on page, show in google search results?

I have noticed that when I google for jobs for example ‘plumber jobs in Melbourne’ some results have a prepended piece of data ‘407 jobs’ before the normal meta description is shown.

example of search result

Anyone know what seek has done to get this data shown in google search results?

How should I correct this unstability of the PDEs results?

I try to solve PDE as the following code but it seems to have an error. Ierror How should I correct this?

Thank you

 sol = c[x, t] /.     NDSolve[{D[c[x, t],         t] == (0.025806686)*D[c[x, t], x, x] - (0.264)*         D[c[x, t],           x] - (1600/0.56)*(2.37*0.01027/(1 + 0.01027*c[x, t])^2)*         D[c[x, t], t], c[x, 0] == 0, c[0, t] == 1},      c, {x, 0, 10}, {t, 0, 500}]; Plot3D[sol, {x, 0, 40}, {t, 0, 4000}, PlotRange -> {0, 1},   PlotPoints -> 97, MaxRecursion -> 7, Mesh -> 19,   ColorFunction ->    Function[{x, t, z},     ColorData["TemperatureMap"][Rescale[z, {-1, 1}]]],   PlotLegends ->    BarLegend[{{White, White, Yellow, Orange, Red}, {0, 1}}],   AxesLabel -> {"Bed Depth (cm)", "Time (min)", "C/Co"},   LabelStyle -> Directive[Black, Bold], PlotStyle -> Opacity[0.80]] 

What is a good method for modelling combinatorial tree (sport competition results)?

Probably newbie question here, please point me out to relevant theories/tutorials if needed :

  • let say I want to evaluate the probabilities of the final rankings for a sport competition
  • the competition involved 8 teams, but I can simplify the problem to 4 contestants (say A – B – C – D)
    • the competition is splitted into n journeys during which every team faces another team (and only one). So with 4 contestants, I have 2 matches per journey
    • at the end of a match, 5 different points attributions are possible (depending on the score)

After one journey, there are 30 different possible combinations in terms of team’s points. So the model looks like a tree with a journey at each level.

Even if I simplify the situation to 2 journeys left, I can’t think of a elegant way to implement this problem (in Python for example) rather than “manually” creating the tree with the 30 combinations at each level and counting the leaves ?

I’m not familiar with this kind of problem so I’m not sure about the path forward.