[{"data":1,"prerenderedAt":320},["ShallowReactive",2],{"project-17509601":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":15,"rank_in_year":16,"shown_in_year":17,"top":18,"tier":19,"category":20,"subcategory":21,"format":22,"keywords":23,"reception":27,"sentiment":28,"stance_mix":29,"scored_comments":33,"aspects":34,"strip":38,"post_text":40,"what":41,"said":65,"maker_in_thread":150,"shape":162,"grid":166,"attempts":281,"same_week":282,"maker_shows":255,"maker_hidden":312,"reader_version":313,"card":314},"17509601","Solving Rush Hour","The 6x6 Sliding Block Puzzle","title","Show HN: Solving Rush Hour, the 6x6 Sliding Block Puzzle","https:\u002F\u002Fwww.michaelfogleman.com\u002Frush\u002F","michaelfogleman.com","fogleman",1531337155,2018,223,46,147,2155,7,"notable","games","puzzle solver","other",[24,25,21,26],"rush hour puzzle","sliding block puzzle","6x6 puzzle","curious",0.171,{"positive":30,"neutral":31,"mixed":32,"critical":32},3,14,0,17,{"idea":35,"docs":36,"performance":37},{"positive":32,"critical":32},{"positive":32,"critical":32},{"positive":32,"critical":32},[32,32,32,32,30,32,30,30,32,32,32,32,32,30,30,32,30,32,32,32,32,32,30,32,32,32,39,32,30,32,32,32,30,30,30,39,30,32,30,39],5,null,{"problem":42,"audience":40,"pricing":40,"motivation":52,"time_to_build":40,"stack":57,"openness":62,"stage":63,"team_size":64},{"value":43,"source":44,"evidence":45},"Finding the hardest Rush Hour puzzles and solving them","inferred",[46,49],{"id":47,"by":11,"text":48},"17509817","Just finished this write up documenting my latest side project. I've been a bit obsessed with this problem for the past few weeks. Hope you like it! Be sure to check out the…",{"id":50,"by":11,"text":51},"17511132","Mentioned this in the Prior Art section and another comment here, but his \"moves\" are single-square steps. Running my solve utility on his hardest puzzle yields: $ go run…",{"value":53,"source":54,"evidence":55},"Side project obsession with the problem","maker",[56],{"id":47,"by":11,"text":48},[58],{"value":59,"source":54,"evidence":60},"Go",[61],{"id":50,"by":11,"text":51},"open_source","launched","solo",{"praise":66,"objections":86,"requests":94,"questions":113,"alternatives":129},[67,75],{"value":68,"source":69,"evidence":70},"Detailed, interesting and well presented","commenter",[71],{"id":72,"by":73,"text":74},"17510441","prawn","Interesting, detailed and well-presented. Well done. My son loves this game. I'll show him the hardest ones you generated.",{"value":76,"source":69,"evidence":77},"Fun game and fun to follow the work",[78,82],{"id":79,"by":80,"text":81},"17510659","cjslep","Awesome! I loved playing this game growing up. Cool to see it again, here.",{"id":83,"by":84,"text":85},"17510515","tpl","This has been fun to follow on his twitter as well. He is a great person to follow!",[87],{"value":88,"source":69,"evidence":89},"Post is a blog write-up rather than something to try",[90],{"id":91,"by":92,"text":93},"17510196","jsnell","Just FYI, Show HN isn't meant for blog posts. It's for things that can be interacted with. See: https:\u002F\u002Fnews.ycombinator.com\u002Fshowhn.html You might want to edit the title.",[95,102],{"value":96,"source":69,"evidence":97},"Web-based version to try the generated puzzles",[98],{"id":99,"by":100,"text":101},"17510775","stu_k","This is great, I love rush hour. Is there an web based version of the game where I can try some of these generated puzzles?",{"value":103,"source":69,"evidence":104},"Harder difficulty metric for puzzles",[105,109],{"id":106,"by":107,"text":108},"17510279","losvedir","Very cool! I'm interested in the \"hardest\" 6x6 puzzle. You show the one that takes the most moves to complete, but I don't think that's necessarily very difficult, if they're all…",{"id":110,"by":111,"text":112},"17510539","bumholio","What we the people are demanding are insanely hard puzzles. Not an enumeration of hard games on the 6x6 board, but a heuristic generator for the 7x7 or the 8x8 or even the 10x10…",[114,122],{"value":115,"source":69,"evidence":116},"How is the hardest puzzle measured, moves or branching",[117,118],{"id":106,"by":107,"text":108},{"id":119,"by":120,"text":121},"17511077","Someone","http:\u002F\u002Fwww.ulb.ac.be\u002Fdi\u002Falgo\u002Fsecollet\u002Fpapers\u002Fcrs06.pdf claims a 6x6 board that requires 93 moves. That could be a matter of counting moves differently (if you move a car two…",{"value":123,"source":69,"evidence":124},"Which search algorithm and solver is used",[125],{"id":126,"by":127,"text":128},"17512693","eachro","What solvers is he using? Is it really just some sort of simulated annealing? I would have expected A* search at a first glance.",[130,137,143],{"value":131,"source":69,"evidence":132},"Unit Rush Hour by Tromp",[133],{"id":134,"by":135,"text":136},"17510866","tromp","Many years ago I investigated [1] the problem of Rush Hour with minimal size cars. I called it Unit Rush Hour, as the cars are just 1x1, but restricted to either horizontal or…",{"value":138,"source":69,"evidence":139},"Anti-Virus by Smart Games",[140],{"id":141,"by":135,"text":142},"17512976","Btw, if you like Rush Hour, I highly recommend Antivirus (terrible name for Googling) by Smart Games [1]. The pieces come in 9 distinct shapes along with 2 wall pieces, which…",{"value":144,"source":69,"evidence":145},"Un-block Me solver",[146],{"id":147,"by":148,"text":149},"17513960","jsd1982","I tackled this myself several years ago but the game was called Un-block Me on Android. Just did a basic BFS implementation in C#. Worked quite well.…",{"comments":151,"answered":39,"key":152},13,[153,156,159],{"id":154,"text":155},"17511088","Nice! I like how the piece directions are indicated in the GIF.",{"id":157,"text":158},"17510294","One simple idea I had was NumMoves * log(ClusterSize) as a difficulty metric. But I'm not sure. I had my wife play several different puzzles to try to gauge difficulty based on…",{"id":160,"text":161},"17510551","Haha. Well, if you have ideas I'm all ears!",{"commenters":163,"max_depth":39,"maker_replies":151,"first_comment_mins":164,"lifespan_hours":165},28,29,103,[167,169,173,175,178,180,181,182,184,187,190,193,195,197,199,202,205,209,211,214,217,219,221,222,224,227,228,229,232,234,236,238,240,245,248,251,253,257,259,261,265,268,271,273,276,279],[134,32,32,168,135,32],"other\u002Fneutral\u002Fnone",[170,32,32,171,172,32],"17510959","commenter\u002Fneutral\u002Fnone","vjeux",[174,32,32,171,135,32],"17511032",[154,32,32,176,11,177],"project\u002Fpositive\u002Fdesign",1,[106,177,30,179,107,32],"project\u002Fneutral\u002Fidea",[157,177,32,179,11,177],[110,177,30,179,111,32],[160,177,32,183,11,177],"maker\u002Fneutral\u002Fnone",[185,177,30,179,186,32],"17510382","ythn",[188,177,32,189,92,32],"17510711","other\u002Fneutral\u002Fidea",[191,177,32,168,192,32],"17511852","hcs",[194,177,32,168,11,177],"17512141",[196,177,32,168,192,32],"17512358",[198,177,32,171,92,32],"17512674",[200,177,32,168,201,32],"17512125","romellem",[203,177,30,179,204,32],"17510730","joefkelley",[206,177,30,207,208,32],"17510916","project\u002Fneutral\u002Fnone","djflutt3rshy",[210,177,32,168,11,177],"17511045",[212,177,30,179,213,32],"17511312","panic",[215,177,32,168,216,32],"17511492","testaccount7",[218,177,32,168,11,177],"17511671",[47,220,32,183,11,177],2,[91,220,32,168,92,32],[223,220,32,168,11,177],"17510243",[225,220,32,168,226,32],"17510324","dang",[119,30,30,207,120,32],[50,30,32,207,11,177],[230,30,32,171,231,32],"17511262","flashman",[141,233,32,168,135,32],4,[72,39,39,235,73,32],"project\u002Fpositive\u002Fnone",[237,39,32,207,11,177],"17510546",[239,39,32,171,73,32],"17538302",[241,242,30,243,244,32],"17511107",6,"project\u002Fneutral\u002Fdocs","hughes",[246,242,32,247,11,177],"17511633","maker\u002Fneutral\u002Fdocs",[249,18,32,189,250,32],"17512779","maaaats",[147,252,32,168,148,32],8,[254,255,30,179,256,32],"17511796",9,"LeonidBugaev",[99,258,30,207,100,32],10,[260,258,32,183,11,177],"17510879",[262,263,30,179,264,32],"17515904",11,"ah0y",[83,266,39,267,84,32],12,"maker\u002Fpositive\u002Fnone",[269,151,30,179,270,32],"17511771","web007",[272,151,32,179,11,177],"17511824",[274,31,30,179,275,32],"17512492","whatever1",[126,277,30,278,127,32],15,"project\u002Fneutral\u002Fperformance",[79,280,39,235,80,32],16,[],[283,288,293,298,303,308],{"id":284,"name":285,"points":286,"category":287},"17487552","Browsh",967,"dev_tools",{"id":289,"name":290,"points":291,"category":292},"17470037","Hacker News job trends",371,"data",{"id":294,"name":295,"points":296,"category":297},"17506753","Markdown New Tab",218,"productivity",{"id":299,"name":300,"points":301,"category":302},"17505559","Oathkeeper",174,"infrastructure",{"id":304,"name":305,"points":306,"category":307},"17508151","Online challenge",143,"learning_science",{"id":309,"name":310,"points":311,"category":302},"17471938","TaskBotJS",137,false,"v2",{"id":315,"name":5,"line":6,"ai":312,"cat":20,"year":13,"points":14,"comments":15,"rec":27,"s":316,"top":18,"kw":317,"maker":11,"domain":10,"tier":19,"attempts":32,"strip":318,"url":9,"mix":319,"praise":68,"objection":88,"sub":21},17509601,0.17,[24,25,21,26],"0000303300000330300000300050300033353035",[30,31,32,32],1794036567727]