Is there a formula or method of planning a flexible homebrew campaign or session?

When ever I’m planning a session for my campaign I tend to plan a very strict plot. It makes me feel comfortable, and though you can never feel ready; it makes me feel ready to play when I have a plan.

If the players go off of the plot it really messes me up.

Is there a specific planning process or formula that most DMs use in planning a session? Put another way: is there a way to plan a session, that is flexible to what the players do.

Is there a formula (or something similar) that most DMs use?

Planning to use 1 arrow to hit a second target if it misses the first target

I’ve read a lot about “shooting the other enemy” and how enemies don’t occupy the entire 5ft square; however what I can’t find is the following scenario:

two orcs one arrow

I intentionally position my character to have a straight line with two enemies. I’m aiming for the first one but in case it misses I want my arrow to continue and possibly hit the next enemy. My understanding is that I can miss for 2 reasons.

  1. I shoot slightly wrong direction
  2. I shoot correctly but the enemy dodges.

It is the situation (2) that I want to take advantage of and basically roll again fo the second enemy, perhaps even with advantage since it didn’t expect to be shot. Would you allow this? What would you ask to roll?

Is there a formula or method of planning a flexible campaign or session? [duplicate]

When ever I’m planning a session for my campaign; I tend to plan a very strict plot. And if the players go off of it; it really messes me up. I was wandering if there was a specific planning process or formula that most DMs use in planning a session. It makes me feel comfortable, and though you can never feel ready; it makes me feel ready to play when I have a plan. However, is there a way to plan a session, that is flexible to what the players do. Like a formula or something that most DMs use?

Prove Lecture Planning is NP-complete

This is a practice problem from my algorithms class. (And no, it was not assigned as homework. I can’t prove this, but you don’t have to answer if you don’t believe me.) To me this seems like a very difficult problem to show NP-completeness for since due to its abundance of features, it’s tricky to mold a known NP-complete problem into it.

You’ve been asked to organize a freshman-level seminar. The plan is to have the first portion of the semester consist of a sequence of $ l$ guest lectures by outside speakers, and have the second portion of the semester devoted to a sequence of $ p$ hands-on projects that the students will do. There are $ n$ options for speakers overall, and in week number $ i$ (for $ i = 1, 2, \ldots, l$ ) a subset $ L_i$ of these speakers is available to give a lecture. On the other hand, each project requires that the students have seen certain background material in order for them to be able to complete the project successfully. In particular, for each project $ j$ (for $ j = 1, 2, \ldots , p$ ), there is a subset $ P_j$ of relevant speakers so that the students need to have seen a lecture by at least one of the speakers in the set $ P_j$ in order to be able to complete the project. So this is the problem: Given these sets, can you select exactly one speaker for each of the first $ l$ weeks of the seminar, so that you only choose speakers who are available in their designated week, and so that for each project $ j$ , the students will have seen at least one of the speakers in the relevant set $ P_j$ . We’ll call this the Lecture Planning Problem. Prove that Lecture Planning is NP-complete.

I should note that it isn’t explicitly stated in the problem, but I’m assuming that a speaker can only give at most one talk. (But if this seems to prevent the problem from being NP-complete, let me know.)

At first I tried solving some graph-based problems (e.g., Independent Set) using Lecture Planning, but wasn’t able to proceed because I’m not sure how you would partition vertices into subsets $ L_i$ or $ P_j$ .

Thus I decided to go to 3-SAT. Even then, it is not obvious how you would solve 3-SAT using this setup. E.g., what would the clauses be? My first thought was they could be the $ l$ subsets $ L_i$ , and you would need a variable to be true in each; this would correspond to picking a speaker for that week. But then how do you incorporate the $ P_j$ so as to ensure the formula is satisfied (if satisfiable)?

Also thought about making the clauses the $ P_j$ , but again, this didn’t really seem to work.

I would greatly appreciate a hint. Thanks!

Customized Event Planning Mirror Booth

Our Factory
Shenzhen Eagle Technology Co., Ltd established in 2017, is a professional digital manufacturer and exporter that concentrate with its unique design and patent of mirror me booth, mirror booth, beauty mirror booth, mirror photo booth, selfie mirror, events photo booth, magic mirror booth etc.
Our products passed TUV international quality standards: CE, RoHS, FCC. In 2018, we provided services for 110 new customers whose come from 15 different countries and got their good confidence with us. Hope to build win-win cooperation with you in the future.
Own a powerful energetic team with 24 hours professional customers supporters. Have 22 years experience engineer lead R&D department. Quickly make client鈥檚 requirements and idea to real products. Every year keep develop more than 4 new styles to keep leader market requirements.
For control quality process, work with China high level suppliers. Own completed production lines: CNC, Laser cutting, Diamond pushed, laser dotting, SMD, aging test. Have completed quality control system, every machine passed 48 hours aging test before packing, control throughout all quality stages to guarantee total customer satisfaction. Main raw material suppliers are come from Fortune 500 companies. As a result of our high quality and outstanding customer service, we have built global sales network it reaches Euro, North America, South America, Australia, Middle East, South Asia.
Welcome to visit our company and looking forward to our cooperation!
Operation Philosophy: Quality is not an act, it is a habit.
Company Mission: Picture your Happiest Memories.
Our Product
Mirror me booth, photo booth
Product Application
The magic mirror is perfect for any event: Cencerts, brithday parties, weddings, retirement, graduation, fundraisers, school dances, opening ceremony and so much more.It’s also use in nomarl business actitivt: 5 star hotel,Jewelry shop, make up stores, clother shop…..all stores that you want show your unique style.
Our Certificate
Company SGS: 18722362_P+T, 18722363_P+T, Product: TUV: CE, ROHS. FCC, patent, utility model, appearance
Production Market
In 2018, we provided services for 110 new customers whose come from 15 different countries and got their good confidence with us. Hope to build win-win cooperation with you in the future.
Our Service
Own a powerful energetic team with 24 hours professional customers supporters. Have 22 years experience engineer lead R&D department. Quickly make client鈥檚 requirements and idea to real products. Every year keep develop more than 4 new styles to keep leader market requirements.Customized Event Planning Mirror Booth
website:http://www.eagle-groups.com/

Automatic planning publication OOTB – Is that possible?

I’m on Sharepoint 2013 and I would like to create a workflow for schedules. The idea would be that a private planning would be created every Monday, that only one group could modify it during the week. Then this schedule should be published on Friday to be visible to other groups.

The question seems pretty simple but I’ve some restrictions : – I can’t have admin rights for Sharepoint or the SP server. – I only have access to the web interface, I can’t use Sharepoint Designer or any apps outside the browser.

Do you think that’s possible? Or I can’t because of these restrictions ? In that case, do you have any suggestions for doing something like that?

Event planning application database schema

I am planning to develop an Event Planning Application. Currently I’m in the stage of planning the app structure, for example database schemas. Basically there will be two kinds of users:

The event planner: Has access to a dashboard, list of guests, etc.

The event guest: One guest is assigned to one event. Can login and answer questions, access photos from the event

Now my question: What is the best way to store the guests regarding security, scalability and maintainability. Is it ok to store all guests in one single database table ‘guests’ with a column ‘event_id’ or is it better to create a table for every event and have multiple tables with guests like ‘event_1_guests’, ‘event_2_guests’, and so on.