hard20 pts · first answer countsgraphsbfsstate-space
Grid search where keys open doors
A maze has up to 6 keys that open matching doors. You need the shortest path to collect all keys. On a 30 × 30 grid, how many BFS states can there be?
Discussion 0
Join free to post in the discussion.
Related questions
- Edges in a tree with n nodesBackend Developer
- Most nodes in a binary tree of height 3Backend Developer
- What inorder traversal of a BST givesBackend Developer
- Preorder output of a small treeBackend Developer
- Traversal for freeing a whole treeBackend Developer
- Data structure for level-order traversalBackend Developer
- BST search time, typical and worstBackend Developer
- Leaves in a full binary treeBackend Developer