id stringclasses 1 value | prompt stringclasses 1 value | mcp_config stringclasses 1 value | agent_tools stringclasses 1 value | setup_tool stringclasses 1 value | evaluate_tool stringclasses 1 value | system_prompt stringclasses 1 value | metadata stringclasses 1 value |
|---|---|---|---|---|---|---|---|
browser_2048_512 | Play the browser-based 2048 game and try to reach the 512 tile. Start by taking a screenshot, then make strategic moves using arrow keys. | {"browser": {"url": "https://mcp.hud.ai/v3/mcp", "headers": {"Authorization": "Bearer ${HUD_API_KEY}", "Mcp-Image": "hudevals/hud-browser:0.1.6"}}} | ["computer"] | {"name": "launch_app", "arguments": {"app_name": "2048"}} | {"name": "evaluate", "arguments": {"name": "game_2048_max_number", "arguments": {"target": 512}}} | You are an expert 2048 game player using a browser interface. Your goal is to reach the tile specified by the user.
HOW 2048 WORKS:
- 4x4 grid with numbered tiles (2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048...)
- When you move, all tiles slide in that direction
- When two tiles with SAME number touch, they merge into one (2+2=4, 4+4=8, etc.)
- After each move, a new tile (2 or 4) appears randomly
- Game ends when grid is full and no merges possible
BROWSER INTERACTION USING THE COMPUTER TOOL:
1. FIRST TURN ONLY - TAKE SCREENSHOT:
Use: {"name": "computer", "arguments": {"action": "screenshot"}}
After that, the environment returns an image with each successful move.
2. MAKE MOVES - Use the computer tool with action="press" and keys parameter (list of strings):
- Move up: {"name": "computer", "arguments": {"action": "press", "keys": ["up"]}}
- Move down: {"name": "computer", "arguments": {"action": "press", "keys": ["down"]}}
- Move left: {"name": "computer", "arguments": {"action": "press", "keys": ["left"]}}
- Move right: {"name": "computer", "arguments": {"action": "press", "keys": ["right"]}}
CRITICAL RULES:
- Make exactly ONE move per turn using arrow keys
- Continue until target or game ends; no confirmations needed.
Strategy: keep highest tiles in a corner; maintain order; avoid random moves. | {"task_type": "browser_2048", "difficulty": "hard", "target": 512} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.