2026 Term 1 · Forenoon

32 questions from 26T1_fn.yaml. Answer everything, then hit "Check answers".

Worked solutions, step by step ↗Stuck on a question? Open its full solution — traces, visuals, shortcuts.

32 questions

Question stem · Q1

Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively.

A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 212 denotes that jugs a, b and c contain 2L, 1L and 2L of water, respectively.

The allowable moves (actions) are:

xETy: pick up jug x and empty it into jug y and jug y is also topped up,
xEy: pick up jug x and empty it into jug y and jug y is still not topped up,
xTy: pick up jug x and top up jug y and jug x is still not emptied out.

For example: $212 c E a 410 a T b 230 b E T a 500$ .

MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, $MoveGen (212) = {032, 302, 410, 230}$ .

Based on the above data, answer the given subquestions.

Tip: click any diagram to expand it full-screen.

1.1SEARCHSolution ↗

Let 320 be the start state and 401 be the goal state, find the shortest path from start to goal. Enter the path starting with 320 as a comma separated list of states.

NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 320,302,500

1.2SEARCHSolution ↗

Let 320 be the start state and 401 be the goal state, find the sequence of moves that produce the shortest path from start to goal. Enter the sequence of moves as a comma separated list.

NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: aEb,aTc,bETa,cETb

1 / 9