File size: 8,618 Bytes
986a962
 
 
1
2
3
4
{"suite_version":"2.1.0","pool_sha256":"aaa29189f284bb9624a5fc45649c13ac8e8adc625540614c9e93744324508ae6","source_commit":"6b1a6be1975561240edfd4dffab77236b036798e","system_id":"growth","rules":[{"id":"R1","from":"A","to":"xB"},{"id":"R2","from":"B","to":"yA"},{"id":"R3","from":"A","to":"zA"},{"id":"R4","from":"B","to":"wB"}],"prompt":"Monkey Do 2.1.0: write a general JavaScript function solve(start,target).\nRewrite one matching substring per move, at a zero-based integer position.\nR1: \"A\" -> \"xB\"\nR2: \"B\" -> \"yA\"\nR3: \"A\" -> \"zA\"\nR4: \"B\" -> \"wB\"\nOther characters are inert. Return an array of {rule,start,next} objects describing the full derivation.\nEvery move must be legal and the final state must equal target. Only completed chains receive credit; legal prefixes receive zero.\nAny legal derivation is accepted, up to 1000 moves; intermediate strings must be at most 128 characters.\nReturn [] if unable to solve. Your code gets 3000 ms per chain, in a fresh JavaScript context.\nChains have shortest distances 5, 10, 20, 30 and 50. You will not be shown evaluation pairs. Output code only.","prompt_sha256":"8ded6c1b4786ef90f05bcf41101dba507914a215fe56b18443bba993613370e8","reference_solver_js":"function moves(state,rules) {\n const out=[];\n for(const r of rules) for(let pos=state.indexOf(r.from);pos!==-1;pos=state.indexOf(r.from,pos+1))\n  out.push({rule:r.id,start:pos,next:state.slice(0,pos)+r.to+state.slice(pos+r.from.length)});\n return out;\n}\nfunction search(start,target,rules) {\n const left=new Map([[start,null]]),right=new Map([[target,null]]);\n let lf=[start],rf=[target];\n const reverse=rules.map(r=>({...r,from:r.to,to:r.from}));\n let meet=start===target?start:null;\n while(meet===null && lf.length && rf.length && left.size+right.size<100000) {\n  const forward=lf.length<=rf.length, own=forward?left:right, other=forward?right:left;\n  const next=[];\n  for(const state of forward?lf:rf) {\n   for(const m of moves(state,forward?rules:reverse)) {\n    if(m.next.length>128 || own.has(m.next)) continue;\n    own.set(m.next,{parent:state,move:forward?m:{rule:m.rule,start:m.start,next:state}});\n    if(other.has(m.next)){meet=m.next;break;}\n    next.push(m.next);\n   }\n   if(meet!==null) break;\n  }\n  if(forward) lf=next; else rf=next;\n }\n if(meet===null) return [];\n const before=[],after=[];\n for(let s=meet;left.get(s);s=left.get(s).parent) before.push(left.get(s).move);\n for(let s=meet;right.get(s);s=right.get(s).parent) after.push(right.get(s).move);\n return before.reverse().concat(after);\n}\nfunction solve(start,target){return search(start,target,[{\"id\":\"R1\",\"from\":\"A\",\"to\":\"xB\"},{\"id\":\"R2\",\"from\":\"B\",\"to\":\"yA\"},{\"id\":\"R3\",\"from\":\"A\",\"to\":\"zA\"},{\"id\":\"R4\",\"from\":\"B\",\"to\":\"wB\"}]);}","chain_count":20}
{"suite_version":"2.1.0","pool_sha256":"aaa29189f284bb9624a5fc45649c13ac8e8adc625540614c9e93744324508ae6","source_commit":"6b1a6be1975561240edfd4dffab77236b036798e","system_id":"swaps","rules":[{"id":"R1","from":"AB","to":"BA"},{"id":"R2","from":"BA","to":"AB"},{"id":"R3","from":"CD","to":"DC"},{"id":"R4","from":"DC","to":"CD"}],"prompt":"Monkey Do 2.1.0: write a general JavaScript function solve(start,target).\nRewrite one matching substring per move, at a zero-based integer position.\nR1: \"AB\" -> \"BA\"\nR2: \"BA\" -> \"AB\"\nR3: \"CD\" -> \"DC\"\nR4: \"DC\" -> \"CD\"\nOther characters are inert. Return an array of {rule,start,next} objects describing the full derivation.\nEvery move must be legal and the final state must equal target. Only completed chains receive credit; legal prefixes receive zero.\nAny legal derivation is accepted, up to 1000 moves; intermediate strings must be at most 128 characters.\nReturn [] if unable to solve. Your code gets 3000 ms per chain, in a fresh JavaScript context.\nChains have shortest distances 5, 10, 20, 30 and 50. You will not be shown evaluation pairs. Output code only.","prompt_sha256":"28993faec1d4cbe5e455d94a5ea26544dc2c0151262b6ba29290bf3796faabd4","reference_solver_js":"function moves(state,rules) {\n const out=[];\n for(const r of rules) for(let pos=state.indexOf(r.from);pos!==-1;pos=state.indexOf(r.from,pos+1))\n  out.push({rule:r.id,start:pos,next:state.slice(0,pos)+r.to+state.slice(pos+r.from.length)});\n return out;\n}\nfunction search(start,target,rules) {\n const left=new Map([[start,null]]),right=new Map([[target,null]]);\n let lf=[start],rf=[target];\n const reverse=rules.map(r=>({...r,from:r.to,to:r.from}));\n let meet=start===target?start:null;\n while(meet===null && lf.length && rf.length && left.size+right.size<100000) {\n  const forward=lf.length<=rf.length, own=forward?left:right, other=forward?right:left;\n  const next=[];\n  for(const state of forward?lf:rf) {\n   for(const m of moves(state,forward?rules:reverse)) {\n    if(m.next.length>128 || own.has(m.next)) continue;\n    own.set(m.next,{parent:state,move:forward?m:{rule:m.rule,start:m.start,next:state}});\n    if(other.has(m.next)){meet=m.next;break;}\n    next.push(m.next);\n   }\n   if(meet!==null) break;\n  }\n  if(forward) lf=next; else rf=next;\n }\n if(meet===null) return [];\n const before=[],after=[];\n for(let s=meet;left.get(s);s=left.get(s).parent) before.push(left.get(s).move);\n for(let s=meet;right.get(s);s=right.get(s).parent) after.push(right.get(s).move);\n return before.reverse().concat(after);\n}\nfunction solve(start,target){return search(start,target,[{\"id\":\"R1\",\"from\":\"AB\",\"to\":\"BA\"},{\"id\":\"R2\",\"from\":\"BA\",\"to\":\"AB\"},{\"id\":\"R3\",\"from\":\"CD\",\"to\":\"DC\"},{\"id\":\"R4\",\"from\":\"DC\",\"to\":\"CD\"}]);}","chain_count":20}
{"suite_version":"2.1.0","pool_sha256":"aaa29189f284bb9624a5fc45649c13ac8e8adc625540614c9e93744324508ae6","source_commit":"6b1a6be1975561240edfd4dffab77236b036798e","system_id":"reduction","rules":[{"id":"R1","from":"AA","to":"A"},{"id":"R2","from":"BB","to":"B"},{"id":"R3","from":"AB","to":"C"},{"id":"R4","from":"AC","to":"C"},{"id":"R5","from":"CB","to":"C"}],"prompt":"Monkey Do 2.1.0: write a general JavaScript function solve(start,target).\nRewrite one matching substring per move, at a zero-based integer position.\nR1: \"AA\" -> \"A\"\nR2: \"BB\" -> \"B\"\nR3: \"AB\" -> \"C\"\nR4: \"AC\" -> \"C\"\nR5: \"CB\" -> \"C\"\nOther characters are inert. Return an array of {rule,start,next} objects describing the full derivation.\nEvery move must be legal and the final state must equal target. Only completed chains receive credit; legal prefixes receive zero.\nAny legal derivation is accepted, up to 1000 moves; intermediate strings must be at most 128 characters.\nReturn [] if unable to solve. Your code gets 3000 ms per chain, in a fresh JavaScript context.\nChains have shortest distances 5, 10, 20, 30 and 50. You will not be shown evaluation pairs. Output code only.","prompt_sha256":"d6a1a4025fa92ade81acc1c7bcbaea9934f5b97859795eb6d6c7c3050cdca0d9","reference_solver_js":"function moves(state,rules) {\n const out=[];\n for(const r of rules) for(let pos=state.indexOf(r.from);pos!==-1;pos=state.indexOf(r.from,pos+1))\n  out.push({rule:r.id,start:pos,next:state.slice(0,pos)+r.to+state.slice(pos+r.from.length)});\n return out;\n}\nfunction search(start,target,rules) {\n const left=new Map([[start,null]]),right=new Map([[target,null]]);\n let lf=[start],rf=[target];\n const reverse=rules.map(r=>({...r,from:r.to,to:r.from}));\n let meet=start===target?start:null;\n while(meet===null && lf.length && rf.length && left.size+right.size<100000) {\n  const forward=lf.length<=rf.length, own=forward?left:right, other=forward?right:left;\n  const next=[];\n  for(const state of forward?lf:rf) {\n   for(const m of moves(state,forward?rules:reverse)) {\n    if(m.next.length>128 || own.has(m.next)) continue;\n    own.set(m.next,{parent:state,move:forward?m:{rule:m.rule,start:m.start,next:state}});\n    if(other.has(m.next)){meet=m.next;break;}\n    next.push(m.next);\n   }\n   if(meet!==null) break;\n  }\n  if(forward) lf=next; else rf=next;\n }\n if(meet===null) return [];\n const before=[],after=[];\n for(let s=meet;left.get(s);s=left.get(s).parent) before.push(left.get(s).move);\n for(let s=meet;right.get(s);s=right.get(s).parent) after.push(right.get(s).move);\n return before.reverse().concat(after);\n}\nfunction solve(start,target){return search(start,target,[{\"id\":\"R1\",\"from\":\"AA\",\"to\":\"A\"},{\"id\":\"R2\",\"from\":\"BB\",\"to\":\"B\"},{\"id\":\"R3\",\"from\":\"AB\",\"to\":\"C\"},{\"id\":\"R4\",\"from\":\"AC\",\"to\":\"C\"},{\"id\":\"R5\",\"from\":\"CB\",\"to\":\"C\"}]);}","chain_count":20}