1:"$Sreact.fragment"
2:I[54439,["/_next/static/chunks/0v0l27rweo6y8.js","/_next/static/chunks/0oj_gqyj_v382.js"],"ViewportBoundary"]
3:I[54439,["/_next/static/chunks/0v0l27rweo6y8.js","/_next/static/chunks/0oj_gqyj_v382.js"],"MetadataBoundary"]
4:"$Sreact.suspense"
5:I[40597,["/_next/static/chunks/0v0l27rweo6y8.js","/_next/static/chunks/0oj_gqyj_v382.js"],"IconMark"]
0:{"rsc":["$","$1","h",{"children":[null,["$","$L2",null,{"children":[["$","meta","0",{"charSet":"utf-8"}],["$","meta","1",{"name":"viewport","content":"width=device-width, initial-scale=1"}],["$","meta","2",{"name":"theme-color","content":"white","media":"(prefers-color-scheme: light)"}],["$","meta","3",{"name":"theme-color","content":"black","media":"(prefers-color-scheme: dark)"}],["$","meta","4",{"name":"color-scheme","content":"light dark"}]]}],["$","div",null,{"hidden":true,"children":["$","$L3",null,{"children":["$","$4",null,{"name":"Next.Metadata","children":[["$","title","0",{"children":"Tower of Hanoi | ABDIMAS Computational Thinking"}],["$","meta","1",{"name":"description","content":"Tower of Hanoi adalah puzzle klasik yang mengajarkan pemikiran rekursif. Tujuan Anda adalah memindahkan semua disk dari batang awal ke batang akhir, dengan mematuhi aturan: hanya satu disk yang dapat dipindahkan pada satu waktu, dan disk yang lebih besar tidak dapat diletakkan di atas disk yang lebih kecil."}],["$","meta","2",{"name":"generator","content":"v0.app"}],["$","link","3",{"rel":"icon","href":"/icon-light-32x32.png","media":"(prefers-color-scheme: light)"}],["$","link","4",{"rel":"icon","href":"/icon-dark-32x32.png","media":"(prefers-color-scheme: dark)"}],["$","link","5",{"rel":"icon","href":"/icon.svg","type":"image/svg+xml"}],["$","link","6",{"rel":"apple-touch-icon","href":"/apple-icon.png"}],["$","$L5","7",{}]]}]}]}],["$","meta",null,{"name":"next-size-adjust","content":""}]]}],"isPartial":false,"staleTime":300,"varyParams":null,"buildId":"JKvBLYH6YIllPG_-WIW-D"}