Back to results
Explore the library298 guides total · goals, work & tasks
By goal

Choose what you want to achieve.

By work or interest

Choose a setting you work or spend time in.

By task

Choose the kind of help you want.

Counts show all available guides. Filters combine to narrow your results.

Make life easierGuide

Compare journeys from a supplied timetable

Check arrival deadlines and walking constraints against fully supplied journey facts, without live travel claims.

Illustrative resourceNot tool-testedAdults who want a practical, low-stakes way to compare journeys from a supplied timetable
What you’re working towards

Check arrival deadlines and walking constraints against fully supplied journey facts, without live travel claims. The worked result is a written example for practice; the AI steps have not been tested.

Download playbook .md

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

Open a chat and paste the example

Open https://chatgpt.com and choose New chat. Copy every line under Input in this guide into the message box. Then add the prompt below (the instructions telling the assistant what to do) and send both together. Expect a written response shaped like the example under Output. The wording may differ. If the assistant asks for information already in the input, point to that line; if a necessary fact is missing, keep it unknown rather than guessing.

Your starting prompt
Compare the complete made-up journeys above against the earliest departure, arrival deadline and walking limit. Calculate walking totals, arrival buffers and initial waits. Choose using the stated priority order. Keep unknown fares, access and reliability unknown; do not search or make live-service claims.
02

Check the specific result

Add walking legs separately from vehicle time. A is exactly at the 15-minute boundary, B totals 8 minutes, and C fails at 20. B must win the specified preference even though A arrives earlier. Compare it with the Input yourself. If the response fails a check, paste the correction prompt below into the same chat. Recheck the corrected version before saving it.

Your starting prompt
Recalculate walking totals, departure waits and arrival buffers from the original times. Apply the walking hard limit before the preference order. Correct any real-world transit claim unsupported by the input.
03

Try it with your own example

Open a new chat. Copy the prompt below, then replace [PASTE YOUR INPUT HERE] with your own non-sensitive facts and rules. Include the kinds of details listed under Requirements. Send the whole message. Expect the same kind of result as this guide, using your values. Compare every name, number and rule with your input. If something differs, point to the exact mismatch and ask for a corrected complete answer. Save only a version you have checked.

Your starting prompt
Compare my supplied journeys against my earliest departure, arrival deadline and walking limit below. Calculate walking totals, arrival buffers and initial waits. Choose only by my stated priority order. Keep missing fares, access and reliability unknown. Do not search or imply these are live services.

Use only the new input below. If a fact needed to finish is missing, ask me for it before choosing an answer.

MY INPUT
[PASTE YOUR INPUT HERE]
Optional: improve the result

Stress-test one supplied delay

Explore a declared scenario rather than pretending to predict service reliability. This extension uses the worked example. Return to that example chat, or paste its input and your checked example answer into a new chat first. Do not apply its sample values unchanged to your own input.

Advanced prompt
Scenario only: B’s tram arrives 10 minutes later, with its other facts unchanged. Recalculate B’s destination arrival and deadline status. Reapply the original choice rules to A, B and C; keep this scenario separate from actual travel information.
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.

The starting point

Synthetic input
Made-up example for practice.

Made-up journeys for one fictional weekday; all facts below are supplied for this exercise, not live transit data. Start from home no earlier than 08:00. Arrive at the destination by 09:00. Walking limit: no more than 15 minutes total. A: leave home 08:05, walk 8 minutes, bus departs 08:15 and arrives 08:43, walk 7 minutes, arrive 08:50; no transfers. B: leave 08:10, walk 4 minutes, tram departs 08:16 and arrives 08:48, walk 4 minutes, arrive 08:52; no transfers. C: leave 08:00, walk 10 minutes, bus departs 08:12 and arrives 08:38, walk 10 minutes, arrive 08:48; no transfers. Preference among feasible options: least walking, then largest arrival buffer. No fare, accessibility, service reliability or current availability facts are supplied.

Copies text only. For image or file tasks, use the source files named in the steps too.

Download source .txt

The intended result

Illustrative output
Written example for practice; not a recorded AI response.

Recommended by the supplied preference rule: B.
A: 8 + 7 = 15 walking minutes; 10-minute arrival buffer; feasible. Initial wait: 08:13 to 08:15, 2 minutes.
B: 4 + 4 = 8 walking minutes; 8-minute arrival buffer; feasible. Initial wait: 08:14 to 08:16, 2 minutes.
C: 10 + 10 = 20 walking minutes; 12-minute arrival buffer; fails the 15-minute walking limit. Initial wait: 08:10 to 08:12, 2 minutes.
B wins because it has the least walking among feasible options. A has a larger arrival buffer but that is the second preference.
Before a real journey, verify the actual service, times and any relevant access requirements. This comparison establishes no current availability or fare.
Download result .txt
You’re the final check

Check the worked example.

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 fictional or old timetable cannot establish a real service is running. Check current information before travel.
  • Do not silently substitute fastest arrival for the user’s stated priority of least walking.

What has been checked?

Documentation
No dated source review recorded.
Included files
No scoped artifact-check record.
AI workflow
Not run in a recorded consumer-AI workflow.
Time savings
Time savings not measured

Copy these instructions

Your browser blocked automatic copying. Select the text below and copy it.