Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create/Generating the BFS Tree #33

Closed
2 tasks done
DPigeon opened this issue Feb 12, 2020 · 1 comment
Closed
2 tasks done

Create/Generating the BFS Tree #33

DPigeon opened this issue Feb 12, 2020 · 1 comment
Assignees
Labels
BFS Related to Best-First Search.
Milestone

Comments

@DPigeon
Copy link
Owner

DPigeon commented Feb 12, 2020

As a user,

I want to generate a BFS tree that will be based of A* so that it derives of it.
If a solution is found after searching <= max l nodes, your program will display the solution
using the same format as indicated above.

f(n) = 0 + h(n)

where g(n) = 0

Acceptance of Criteria:

  • g(n) = 0
  • Derive from A* so that f(n) = 0 + h(n)
@DPigeon DPigeon added the BFS Related to Best-First Search. label Feb 12, 2020
@DPigeon DPigeon added this to the Deliverable 2 milestone Feb 12, 2020
@DPigeon DPigeon mentioned this issue Feb 17, 2020
DPigeon pushed a commit that referenced this issue Feb 23, 2020
DPigeon pushed a commit that referenced this issue Feb 23, 2020
@DPigeon DPigeon mentioned this issue Feb 23, 2020
@DPigeon DPigeon self-assigned this Feb 24, 2020
@DPigeon
Copy link
Owner Author

DPigeon commented Feb 24, 2020

Implemented.

@DPigeon DPigeon closed this as completed Feb 24, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
BFS Related to Best-First Search.
Projects
None yet
Development

No branches or pull requests

1 participant