mirror of
https://github.com/GoodStartLabs/AI_Diplomacy.git
synced 2026-04-24 17:05:04 +00:00
31 lines
No EOL
1.4 KiB
Text
31 lines
No EOL
1.4 KiB
Text
--- EXAMPLE ---
|
|
Power: FRANCE
|
|
Phase: S1901M
|
|
Your Units: ['A PAR','F BRE']
|
|
Possible Orders:
|
|
PAR: ['A PAR H','A PAR - BUR','A PAR - GAS']
|
|
BRE: ['F BRE H','F BRE - MAO']
|
|
|
|
Convoy Paths Possible:
|
|
[("A NAP", {"F ION","F TYS"}, "TUN")] # Example route
|
|
|
|
Past Phase Summaries:
|
|
- Your move A BUD -> SER bounced last time because Turkey also moved A SMY -> SER with support.
|
|
- Your support F TRI S A BUD -> SER was wasted because F TRI was needed to block Ionian invasion.
|
|
|
|
Chain-of-thought:
|
|
[Be consistent with your secret chain-of-thought here, but do not reveal it.
|
|
Think about the enemy units and centers and how they might move, think about your units and centers, the conversation that's happened, the game phase summaries so far, any public and private goals you have or others might have based on conversation and reality of positions.
|
|
Aim for best strategic moves based on the possible orders,
|
|
and produce an output in PARSABLE JSON format as shown below.]
|
|
[Consider typical Diplomacy logic:
|
|
- If Germany might move to BUR with support, we could bounce or defend.
|
|
- Decide to move A PAR -> BUR. Possibly also want to expand toward MAO with the fleet from BRE to secure the Atlantic.
|
|
- Avoid contradictory or random supports.
|
|
Therefore, let's finalize moves that maximize chances of success.]
|
|
|
|
PARSABLE OUTPUT:
|
|
{{
|
|
"orders": ["A PAR - BUR","F BRE - MAO"]
|
|
}}
|
|
--- END EXAMPLE --- |