Looking for a secure project management platform for our group to use [closed]

Our group is a non-profit (most of us are volunteers) with a limited budget doing community awareness on the topic of safe technology use to support health and safety.

We are looking for a project management platform that is safe, secure (data encrypted?), and has a good track record of not having any past security breaches. We need the platform to organize our meetings and activities, as well as facilitate our information and document sharing.

We are looking for project management platform options that have measures in place that would make it difficult, if not impossible, for others to steal information/documents and/or take note of what we are doing/sharing.

Any suggestions on where to look?

What can I do about the guys being distracted by a new girl in D&D group?

We recently got a new party member, and she is … well, extremely distracting if you catch my drift. As the DM it is frustrating, because all the guys are trying to flirt with her, and shower her with items in game. The whole thing is quickly becoming a mess. (One even attempted to grope her, In the game and real life, an issue being addressed in a separate question) Seriously, I have no freaking idea what to say to the guys, and how to do it, the whole thing just seems so … awkward. Not only that, but I too have found myself attracted to her. How do I get my own, and my group’s hormones to be put away so we can play the game and have fun; which is what I’m sure she is trying to do also. We are a bunch of 8th and 9th graders and we are all friends.

Can someone help me?

What is the mechanical reason for rolling the same initiative for a group of creatures?

The 5th ed Players handbook states that

The GM makes one roll for an entire group of identical creatures, so each member of the group acts at the same time.

Historically in other systems I have rolled initiative for all NPC’s individually, allowing for the fact some may react quicker then there counterparts.

Has the reason for this bulk rolling of NPCs ever been explained, or is it simply a mechanic to make things run smoother?

Is a young black dragon enough of a challenge alone for group of five level-5 characters?

I have a 5-member party in D&D 5e (ranger, fighter, sorcerer, rogue and bard) who are all level 5. They will soon be meeting with the “big bad”, a young black dragon, in his lair which contains pools of acid. They would most likely be fully rested before the fight.

I know the CR is 7, but I was wondering whether it would prove to be a satisfying battle, in the sense that they may come close to defeat and might be able to beat the odds.

Is this fight well-balanced? Would it be challenging?

If not, should I add some hatchlings or small mobs to adjust the action economy appropriately?

Union of every language within group of decidable languages is also decidable?

So I was trying to solve following exercise:

Let $ (L_{i})_{i \in \mathbb{N}}$ be a family of decidable languages – this means that every $ L_{i}$ is decidable. Then $ \cup_{i \in \mathbb{N}}L_{i} $ is also decidable. Right or wrong?

The solution states, that this statement is wrong because we can set $ L_{i}:=\{f(i)\}$ with $ f : \mathbb{N} \rightarrow H_{0}$ and will therefore receive $ \cup_{i \in \mathbb{N}}L_{i} = H_{0}$ . At the same time $ L_{i}$ languages are still decidable, for every $ i \in \mathbb{N}$ because they are finite.

However I still struggle to understand how exactly a language can be decidable with $ f : \mathbb{N} \rightarrow H_{0}$ , because I thought that $ H_{0}$ was not decidable.

Thanks in advance!!

Minimum number of given operations in order to group letters in a string


Suppose we have a string containing letters ‘A’,’B’,’C’,’D’, and the characters are placed in a stack.We also have an empty stack.Ultimately,we want all letters grouped in the 2nd stack,using only 3 operations:

  • push("p"): Removes an items from the bottom of the 1st stack and place it to the top of the 2nd
  • complement("c"): Replace every all letters of the 1st stack with they "complements".The pairs are A – B and C – D
  • reverse("r"): Reverse the content of the 2nd stack.The top becomes bottom and bottom->top.

Example of moves

| Move | First Stack | Second Stack | +------+-------------+--------------+ |      | DBACA       |              | +------+-------------+--------------+ | p    | DBAC        | A            | +------+-------------+--------------+ | p    | DBA         | CA           | +------+-------------+--------------+ | r    | DBA         | AC           | +------+-------------+--------------+ | p    | DB          | AAC          | +------+-------------+--------------+ | c    | CA          | AAC          | +------+-------------+--------------+ | p    | C           | AAAC         | +------+-------------+--------------+ | r    | C           | CAAA         | +------+-------------+--------------+ | p    |             | CCAAA        | +------+-------------+--------------+ 

Note that the example above finds a solution,but not the minimum solution.The correct answer would be "ppr ppp"

Correct examples

Spaces in the sequence have no meaning and are added for readability purposes.

+------------------------+-------------------------------------+ | First Stack (input)    | Moves (output)                      | +------------------------+-------------------------------------+ | DD                     | pp                                  | +------------------------+-------------------------------------+ | BADA                   | ppr pp                              | +------------------------+-------------------------------------+ | DADA                   | ppc pp                              | +------------------------+-------------------------------------+ | DBACA                  | pprppp                              | +------------------------+-------------------------------------+ | BDA CACA               | ppr prp rppp                        | +------------------------+-------------------------------------+ | CAC DCDC               | pcp cpc pcp cpp                     | +------------------------+-------------------------------------+ | ADA DBD BCB DBCB       | ppr pcr pcr prp rpr prp rpr prp rp  | +------------------------+-------------------------------------+ | DAB BCC DCC BDC ACD CC | ppc pcp cpp rpp rpp cpc ppr ppc prp | +------------------------+-------------------------------------+ 

Brute force approach

We could just use brute force approach,calculating all possible moves until the first stack is empty.This could be done using BFS or A* algorithms.

For example,we could initialize an empty queue,start from a parent node and create 3 new nodes for every possible move.Then add these nodes to the queue.Every time remove a node from the queue and apply the operations.Save the sequence of moves while nodes are created.If the last move was a "c",then skip "c" operation for this node.The same is true about "r" operation (no repetitive c’s or r’s).If stack1 = empty for a node,then finish the program and return the sequence of moves.


Is there a better way to solve this problem? Can we apply some heuristics as improvement in the brute force approach? Thank you in advance.

System for really large group one-shot?

Every year, my youth group pulls an all-nighter.

Given that we do these in church and at night, with a group of 15-20 people, I think this would be the perfect environment to do a group Murder Mystery campaign, where I’d introduce some sort of moral debate – for example, have an Angels & Demons sort of plot, with several religious members being killed, and, in your search for the killer, you have to look into their motivations and debate the sins of the church itself.

I have some experience with D&D but I really don’t know of any other formats, much less ones that would work with a group this big (in terms of logistics, it doesn’t make sense for people to have to create very complex characters or work with a lot of rules). I also like the idea of a LARP, because it would make more sense for the people who’ve never played any RPGs.

Does anyone have an idea of where I could start looking for something like this?

How do I DM for this group when we can’t handle a large group properly, but also can’t count on any smaller group all attending?

I just concluded an online game with my players. (We played 5E, but I want to move to Dungeon World.) I started with four players, and that has since grown to around ten people wanting to play, which is a problem as even with only six players I’ve started getting comments about there being too little time spread around to too many people.

I’ve tried a few approaches to help mitigate this, but every time I try playing with a smaller group, I run into the same problem: someone in the smaller party can’t make it.

This means running for the active party is that much harder because so much more of the party is gone, and the inactive players start wanting to play because they actually showed up on time ready to play. But there are enough of them that if I find a narrative reason someone else can come along, they all try to take it, and grumble about having to stay in town (or wherever) for no reason if they don’t get it.

How do I DM for this group when we can’t handle a large group properly, but also can’t count on any smaller group all attending?