Counts show all available guides. Filters combine to narrow your results.
Build a workflowGuide
Check whether a small check-in plan can handle a rush
Model a small queue minute by minute under explicit simplifying assumptions.
Illustrative resourceNot tool-testedOrganizers exploring a small synthetic check-in queue
What you’re working towards
A deterministic tabletop queue simulation from supplied arrivals and service times, with waiting/backlog shown and assumptions explicit. This is a written practice result, not a recorded AI run.
Your choice also saves this guide’s current worked-example checkmarks. Only this browser; no account or sync. View saved guides
Saving needs JavaScript. Reading and downloading this guide does not save it.
Make a start
One step at a time.
3 steps
Start with the synthetic worked example or other non-sensitive inputs. Run one prompt at a time in your chosen AI tool. Replace any bracketed placeholders with the requested material, check each reply, and supply the source or earlier outputs that step needs. Paste them again if the tool lacks that context.
Start with the synthetic example, then adapt each prompt to your task.
01
Try the complete example
Open a text AI chat you already have permission to use. Paste the whole prompt below, from TASK through END INPUT, and send it. The input is source material; do not paste the illustrative Output as an answer to imitate. Expect A deterministic tabletop queue simulation from supplied arrivals and service times, with waiting/backlog shown and assumptions explicit. If you receive advice instead of the result, ask for the complete requested result from the supplied input.
Your starting prompt
TASK
Run the complete deterministic tabletop calculation in text for the baseline and separate slower-service case. Show token-level assignment, start/finish/wait, minute snapshots, maxima and totals. Preserve queue order and same-timestamp event rules. Explain the limits without turning the model into a staffing or safety recommendation.
INPUT
Complete fictional administrative tabletop model for eight adults. Two identical desks D1/D2 open at 09:00. Each serves one person at a time for exactly 1 minute, no interruptions. A1–A6 arrive together at 09:00, in that tie-break order; A7–A8 arrive at 09:02, in that order. One first-come-first-served queue. Finish events free desks before assigning the next waiting arrivals at the same timestamp; D1 receives the earlier queued token when both desks are free. Service intervals include start and exclude finish. No more arrivals.
Also calculate a separate sensitivity case where service takes 2 minutes per person, everything else unchanged. Show each person’s arrival/start/finish and start-wait, minute snapshots with in-service and waiting counts, final completion and maximum wait. This is not measured service data, a forecast, crowd-safety analysis or a staffing recommendation.
END INPUT
02
Check and correct
Use eight counters: never assign more than two simultaneously and never start a token before arrival or before its desk is free. Baseline completes 09:04 with waits 0,0,1,1,2,2,1,1; max 2 and sum 8. Slower case completes 09:08 with waits 0,0,2,2,4,4,4,4; max 4 and sum 20. Each snapshot’s serving + waiting + completed equals arrived so far. Compare with the unchanged source yourself. If anything differs, use the correction prompt, then recheck the complete replacement before saving.
Your starting prompt
Check the answer in this sample chat against the complete INPUT above. Use eight counters: never assign more than two simultaneously and never start a token before arrival or before its desk is free. Baseline completes 09:04 with waits 0,0,1,1,2,2,1,1; max 2 and sum 8. Slower case completes 09:08 with waits 0,0,2,2,4,4,4,4; max 4 and sum 20. Each snapshot’s serving + waiting + completed equals arrived so far. Quote each mismatch and its source, then return a complete corrected replacement. If source or answer is missing, ask for it. Do not describe a suggested human trial as completed.
03
Use your own source instead
Open a new chat and copy the prompt below. Replace every bracketed field with your own permitted non-sensitive material, or write unknown. Change the source names, counts, dates and rules together wherever they occur. Expect a complete result using those new values. Compare each source link and calculation with your new input, using the review instructions in this prompt. If a fact or rule is wrong, quote the mismatch and source and ask for a complete corrected replacement; keep essential unknowns held rather than borrowing the practice values.
Your starting prompt
Calculate a small deterministic check-in queue from my synthetic arrivals, desk count, opening/closing rules, service-time assumptions and queue/tie-break discipline. Ask for missing same-timestamp rules rather than choosing secretly. Return each token’s arrival, desk, service start/end and start-wait; provide time snapshots that conserve arrived = waiting + in service + completed. Derive totals, maximum wait and final completion from MY INPUT. Keep any sensitivity case separate and state exactly which assumption changes. Independently simulate with one counter per token and no more simultaneous services than desks. Hold infeasible closing constraints and avoid forecasts, staffing adequacy or safety claims.
MY INPUT
Small synthetic arrival batches: [replace with your source or rule]
Number of check-in desks: [replace with your source or rule]
Fixed service-time assumption: [replace with your source or rule]
Queue discipline: [replace with your source or rule]
Open/close times: [replace with your source or rule]
Allowed changes: [replace with your source or rule]
Use only MY INPUT for facts, quantities, names, dates and permissions. Ask for missing essential facts or conflicting rules instead of guessing. Creative invention is allowed only where this task and my boundaries permit it. Return the actual complete requested result, a separate unknown/hold list and the source-specific review described above. Do not reuse practice-example facts. Keep this a draft; do not publish, contact people, book, buy or change another service.
Optional: improve the result
Add a desk interruption
Optional, sample-only extension. Return to the practice chat, or paste this guide’s complete practice input and your checked answer into a new chat. Model a new explicit constraint rather than assuming staff are always free. This does not apply unchanged to your own source.
Advanced prompt
In a separate one-minute-service sample variant, D2 is unavailable from 09:01 inclusive to 09:03 exclusive. Its 09:00–09:01 service finishes normally. Keep all arrivals and queue rules. Recalculate the full token ledger and minute snapshots; show how the outage changes the maximum wait and final completion. If the complete sample input or answer is missing, ask me to paste it. Keep new variants separate from the original result.
Show, then try
See the shape of the result.
This input is synthetic. The output is a written illustration of the intended result, not a verified AI-tool run.
01 / The starting point
Synthetic input
COMPLETE SYNTHETIC PRACTICE INPUT
Complete fictional administrative tabletop model for eight adults. Two identical desks D1/D2 open at 09:00. Each serves one person at a time for exactly 1 minute, no interruptions. A1–A6 arrive together at 09:00, in that tie-break order; A7–A8 arrive at 09:02, in that order. One first-come-first-served queue. Finish events free desks before assigning the next waiting arrivals at the same timestamp; D1 receives the earlier queued token when both desks are free. Service intervals include start and exclude finish. No more arrivals.
Also calculate a separate sensitivity case where service takes 2 minutes per person, everything else unchanged. Show each person’s arrival/start/finish and start-wait, minute snapshots with in-service and waiting counts, final completion and maximum wait. This is not measured service data, a forecast, crowd-safety analysis or a staffing recommendation.
Copies text only. For image or file tasks, use the source files named in the steps too.
These checks use the worked example and its particular facts. With your own material, check your actual names, numbers, sources and rules; do not reuse the sample’s values as the answer.
Unsaved checks stay in this tab and reset when you reload. If you choose Save guide, its current example checkmarks are kept in this browser when storage is available.
!
A few things to watch for.
A minute’s arrivals must not jump ahead of people already waiting. Keep the tie-break and event order explicit.
Fixed service times are a simplifying assumption, not a measured guarantee. A queue arithmetic result cannot establish crowd safety or staffing adequacy.