Tea Brewing Algorithms at 22 B

Algorithm1:
Processes: A, B, C, D

1. A makes tea.
2. B, C drink tea.
3. D may or may not drink tea.
4. A, B or C drink leftover tea.
5. A washes the vessel.

Algorithm 2:
Processes: A, B, C, D, W

1. A makes tea.
2. W pours honey on bread.
3. B, C drink tea.
4. W talks; A, B, C listen.
5. D drinks coffee in Boston.
6. W eats bread and drinks tea.
7. A washes vessel.

Algorithm 3:
Processes: A, B, C, D, X

1. A makes tea.
2. B, C drink tea.
3. D drinks coffee in Boston.
4. If B drank last, B washes vessel
Else, C washes vessel.
5. X makes separate masala tea.

Algorithm 4:
Processes: A, B, C, D, Y

1. A makes tea.
2. A assigns vessel washing task to either B, C or Y.
3. B, C, Y drink tea.
4. D drinks flavored herbal tea.
4. Assigned process may or may not wash vessel.

Algorithm 5 (Current):
Processes: A, B, C, D, Z

1. Z makes tea.
2. A, B, C drink tea.
3. D drinks tea only if ginger is added.
4. Z washes vessel.
5. Z also washes other vessels in the sink.

Process description:

A, B, C: prashu.exe, sid.exe, jay.exe (in no particular order)
D: inku.exe
W: chaitanya.exe
X: vaibhav.exe
Y: surya.exe
Z: riyaz.exe