Exercises: Games#
Free Association#
The prompter will supply the game token (Start)
and a string, e.g. (Start) Fire
. The LLM must say the first concept the take comes to mind when they process the string, e.g. Warmth
. The prompter in turn must say the first concept that comes to their mind upon reading the LLM response, e.g. Blanket
. The game continues until one of the participants says (Stop)
.
Permutations#
The rules of the Permutation game are as follows. The prompter will provide the game toekn (Permute)
and then a series of letters in a random order. Each turn only adjacent letters can be switched. The game continues until a word emerges. The only legal move in the game is to switch the position of letters. Letters cannot be added or removed. The winner of the game is whoever ends their turn having created a word. For example, given the token (Permute) t c a
, a first turn response might be to permute the first and second character into c t a
. After which, the next turn could permute the middle and last characters to obtain c a t
and thus become the winner.
Connection#
The prompter will supply the game token (Connect)
and a series of strings. The series of strings will have a common property that links them. The LLM must analyze the string and respond any concept that connects the series of strings together. The series can be numerical or categorical in nature.