2_uninformed_search by mohsenosl99 · Pull Request #12 · sut-ai/notes

mohsenosl99 · 2021-10-31T20:31:30Z

No description provided.

@sepehrashs@gmail.com

mohsenosl99 · 2021-11-01T11:11:33Z

SepehrAsh · 2021-11-05T16:13:39Z

notebooks/2_uninformed_search/index.md

+8. Conclusion
+
+
+## Introduction


Please Fulfill The Introduction

SepehrAsh · 2021-11-05T16:14:20Z

notebooks/2_uninformed_search/index.md

+It is not an optimal algorithm in general but if cost of steps be equal to one, this algorithm would be optimal.
+
+As it is obvious this algorithm has some pros and cons. The benefit of it is that it is accurate and easy to run and implement. But if the goal be at depth 21, this algorithm would take hundreds of years to find the solution.
+


You Can Add Some Examples Here

SepehrAsh · 2021-11-05T16:19:29Z

notebooks/2_uninformed_search/index.md

+* Cutoff failure value: It defines no solution for the problem within a given depth limit.
+
+Look at the example:
+![](https://github.com/mohsenosl99/notes/blob/master/notebooks/2_uninformed_search/images/depth-limited-search-algorithm.png)


You Can Describe The Example To Improve The Quality Of Your Lecture Note

SepehrAsh · 2021-11-05T16:20:23Z

notebooks/2_uninformed_search/index.md

+
+**Space Complexity**
+
+The space complexity of IDDFS will be O(bd).


It Would Be Great To Explain More

SepehrAsh · 2021-11-05T16:20:39Z

notebooks/2_uninformed_search/index.md

+
+
+
+## Conclusion


Please Fulfill The Conclusion

SepehrAsh · 2021-11-05T16:22:49Z

notebooks/2_uninformed_search/index.md

+
+
+
+


Please Add References, For Example : You Can Add Where You Read Articles About The Topic, or You can mention where students can find more information about the topic

SepehrAsh · 2021-11-05T16:23:34Z

notebooks/2_uninformed_search/index.md

+
+The iterative search algorithm is useful uninformed search when search space is large, and depth of goal node is unknown.
+
+**Example**


SepehrAsh · 2021-11-05T16:23:49Z

notebooks/2_uninformed_search/index.md

+
+> O(b^d(1 – 1/b)^-2)
+
+Note: In this algorithm because of the fact that we want to avoid space problems, we won't store any data therefore we may have to repeat some actions but it won't trouble us because time complexity still remains O( b^d ), similar to BFS.


SepehrAsh · 2021-11-05T16:24:21Z

notebooks/2_uninformed_search/index.md

+
+
+
+


You Can Add More Information

SepehrAsh · 2021-11-05T20:31:50Z

notebooks/2_uninformed_search/index.md

+
+# Contents 
+
+1. Introduction


Your Titles Should Be Clickable

SepehrAsh · 2021-11-05T20:34:36Z

notebooks/2_uninformed_search/index.md

+2. Breadth-first Search
+3. Uniform cost search
+4. Depth-first Search
+5. Depth-limited Search


You would delete numbers.

SepehrAsh · 2021-11-12T07:40:36Z

notebooks/2_uninformed_search/index.md

@@ -0,0 +1,255 @@
+
+# Uninformed Search


Please explain what the term "Search" means exactly.

You should explain in a way that everyone could read the article and understand the concept.

SepehrAsh · 2021-11-12T07:43:24Z

notebooks/2_uninformed_search/index.md

+Iterative deepening depth-first search
+Bidirectional search
+Conclusion
+


Please add tree search and graph search into your content.

SepehrAsh · 2021-11-12T07:47:06Z

notebooks/2_uninformed_search/index.md

+
+**Completeness**
+
+This algorithm is complete is ifthe branching factor is finite.


Check your sentence.

SepehrAsh · 2021-11-12T07:51:50Z

notebooks/2_uninformed_search/index.md

+
+
+
+


Full review:

Please fulfill the Introduction. ( You can explain terms like "Search", "Optimality", etc in your introduction.

You can add methods I've mentioned in your table of content.

Please make your table of contents clickable.

Discuss a little about your examples.

SepehrAsh · 2021-11-12T07:53:41Z

notebooks/2_uninformed_search/index.md

+* Standard failure value: It indicates that problem does not have any solution.
+* Cutoff failure value: It defines no solution for the problem within a given depth limit.
+
+Look at the example:


The position of the example's image could be better.

mohsenosl99 · 2021-11-12T21:06:53Z

@SepehrAsh

mohsenosl99 added 10 commits October 31, 2021 22:50

Create index.md

0808a54

Delete notebooks/2_uninformed_search directory

51507d2

Create index.md

bfffc92

Create photo

ea42b0e

Add files via upload

213034a

Add files via upload

395f125

Add files via upload

bb142b7

Update index.md

86e9bb8

Create matadata.yml

267d2b4

2_uninformed_search

bd725a2

@sepehrashs@gmail.com

sararajabzadeh requested a review from SepehrAsh November 3, 2021 14:42

SepehrAsh reviewed Nov 5, 2021

View reviewed changes

pouriashm added 3 commits November 10, 2021 07:14

Update index.md

edd57ea

Add files via upload

f095a7e

Update index.md

d711cfd

SepehrAsh reviewed Nov 12, 2021

View reviewed changes

mohsenosl99 and others added 12 commits November 12, 2021 21:26

Update index.md

6b852c2

Update index.md

7815ea2

Update index.md

50b2f04

Update index.md

4a1a828

Update index.md

a6fe33b

Update index.md

7f198ca

Update index.md

e27700b

Update index.md

1dfdd8a

Update index.md

dc1f76a

Update matadata.yml

b09fc8f

Add files via upload

d0c3daa

Update index.md

d487ca5

mohsenosl99 and others added 3 commits November 12, 2021 23:41

Update index.md

a03bbca

Update index.md

58f3dac

Update index.md

105d71e

mohsenosl99 added 2 commits November 16, 2021 00:03

Update index.md

1e09ab6

Update index.md

52b8202

		It is not an optimal algorithm in general but if cost of steps be equal to one, this algorithm would be optimal.

		As it is obvious this algorithm has some pros and cons. The benefit of it is that it is accurate and easy to run and implement. But if the goal be at depth 21, this algorithm would take hundreds of years to find the solution.


		Space Complexity

		The space complexity of IDDFS will be O(bd).


		The iterative search algorithm is useful uninformed search when search space is large, and depth of goal node is unknown.

		Example


		> O(b^d(1 – 1/b)^-2)

		Note: In this algorithm because of the fact that we want to avoid space problems, we won't store any data therefore we may have to repeat some actions but it won't trouble us because time complexity still remains O( b^d ), similar to BFS.


		Completeness

		This algorithm is complete is ifthe branching factor is finite.

Conversation

mohsenosl99 commented Oct 31, 2021

Uh oh!

mohsenosl99 commented Nov 1, 2021

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

mohsenosl99 commented Nov 12, 2021

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

3 participants