![]() Summary - Graph is solved through one of 4 methods, Breadth First Search, Depth First Search, Uniform Cost Search and A* Search.Click Solve to solve the game and interate through the solution with Prev and Next buttons - Solutions are cached, but some solves take a long timeß.Play the game with WASD or ArrowKeys, press Escape of space to restart from the saved map.All saved grids are stored in your browser's localStorage New grids can be added and existing grids overwritten by saving.= target, & = player, X = block on target, % = player on target) You can always edit the level files ( space = floor, # = wall, B = block. There are interim states (target-block, target-player) that are ommtted fr the sake of simplicity in setting. Click any cell to cycle between floor, wall, block, target and player. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |