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.

Sign up for GitHub

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

Jump to bottom

Suggested modifications to Breadth-First-Search (aima3e Figure 3.11) #3

Open
ctjoreilly opened this issue May 25, 2016 · 0 comments
Open

Suggested modifications to Breadth-First-Search (aima3e Figure 3.11) #3

ctjoreilly opened this issue May 25, 2016 · 0 comments

Comments

@ctjoreilly
Copy link
Collaborator

  1. Drop 'PATH-COST=0' from the line:
    node <- a node with STATE= problem.INTITIAL-STATE, PATH-COST = 0
    as it is not actually referenced explicitly anywhere else in the algorithm.
  2. Rename the algorithm to Breadth-First-Graph-Search (this suggestion applies to several other of the algorithms in Chapter 3 where the pseudo-code depicts a graph based version only of a more general concept).
@ctjoreilly ctjoreilly changed the title Suggested modifications to Figure 3.11 Breadth-First-Search Suggested modifications to Breadth-First-Search (aima3e Figure 3.11) Jun 10, 2016
@articuno12 articuno12 mentioned this issue Mar 1, 2017
Merged
norvig added a commit that referenced this issue Mar 3, 2017
@norvig
Merge pull request #37 from articuno12/master
ee20b9b 
Modification in alpha-beta search , bfs,online dfs and mini max search #26  #27 #28 #3
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ctjoreilly