Talk:2407: Depth and Breadth - Revision history

2A00:F41:70EA:1134:0:55:D65E:F01 at 09:18, 4 December 2025

2025-12-04T09:18:45Z

172.68.86.157 at 10:53, 13 May 2025

2025-05-13T10:53:35Z

172.70.86.116 at 15:58, 4 February 2025

2025-02-04T15:58:44Z

An user who has no account yet at 22:37, 2 September 2023

2023-09-02T22:37:01Z

172.68.63.137 at 18:37, 11 January 2021

2021-01-11T18:37:50Z

172.68.132.19 at 22:17, 8 January 2021

2021-01-08T22:17:52Z

Quantum7: Child enumeration order is arbitrary

2021-01-08T08:46:39Z

Child enumeration order is arbitrary

Quantum7: pseudocode suggestion

2021-01-08T08:44:24Z

pseudocode suggestion

162.158.74.149 at 19:30, 6 January 2021

2021-01-06T19:30:03Z

108.162.219.74 at 18:09, 6 January 2021

2021-01-06T18:09:53Z

← Older revision		Revision as of 09:18, 4 December 2025
Line 39:		Line 39:

	"It may also be how people with OCD search, but this would be very stereotypical." nah, don't worry, as someone with ADHD and possibly OCD that's just relatable [[Special:Contributions/172.68.86.157\|172.68.86.157]] 10:53, 13 May 2025 (UTC)		"It may also be how people with OCD search, but this would be very stereotypical." nah, don't worry, as someone with ADHD and possibly OCD that's just relatable [[Special:Contributions/172.68.86.157\|172.68.86.157]] 10:53, 13 May 2025 (UTC)
		+
		+
		+	"I would have assumed not being allowed to check your pockets is a reference to the myth of Eurydice, perhaps your are allowed to take your keys but they are placed in your pocket and you must trust that they are there.[[Special:Contributions/2A00:F41:70EA:1134:0:55:D65E:F01\|2A00:F41:70EA:1134:0:55:D65E:F01]] 09:18, 4 December 2025 (UTC)

← Older revision		Revision as of 10:53, 13 May 2025
Line 37:		Line 37:

	Though it's noted that the Breadth-First search visits 'node 7' before 'node 6', there's no actual reason why a breadth-first must use (as its breadth-exploring criteria) the same sorting factor as the diagram uses. All it must do is visit each node on a level (going 'wide', assessing all node siblings, or possibly even 'cousins' in turn) before visiting everything yet one lyer further below. It was [sic]ed in the Transcript, but I'm not sure it needed to have been. [[Special:Contributions/172.70.86.116\|172.70.86.116]] 15:58, 4 February 2025 (UTC)		Though it's noted that the Breadth-First search visits 'node 7' before 'node 6', there's no actual reason why a breadth-first must use (as its breadth-exploring criteria) the same sorting factor as the diagram uses. All it must do is visit each node on a level (going 'wide', assessing all node siblings, or possibly even 'cousins' in turn) before visiting everything yet one lyer further below. It was [sic]ed in the Transcript, but I'm not sure it needed to have been. [[Special:Contributions/172.70.86.116\|172.70.86.116]] 15:58, 4 February 2025 (UTC)
		+
		+	"It may also be how people with OCD search, but this would be very stereotypical." nah, don't worry, as someone with ADHD and possibly OCD that's just relatable [[Special:Contributions/172.68.86.157\|172.68.86.157]] 10:53, 13 May 2025 (UTC)

← Older revision		Revision as of 15:58, 4 February 2025
Line 35:		Line 35:

	now randall should also implement a toast search! [[User:An user who has no account yet\|An user who has no account yet]] ([[User talk:An user who has no account yet\|talk]]) 22:37, 2 September 2023 (UTC)		now randall should also implement a toast search! [[User:An user who has no account yet\|An user who has no account yet]] ([[User talk:An user who has no account yet\|talk]]) 22:37, 2 September 2023 (UTC)
		+
		+	Though it's noted that the Breadth-First search visits 'node 7' before 'node 6', there's no actual reason why a breadth-first must use (as its breadth-exploring criteria) the same sorting factor as the diagram uses. All it must do is visit each node on a level (going 'wide', assessing all node siblings, or possibly even 'cousins' in turn) before visiting everything yet one lyer further below. It was [sic]ed in the Transcript, but I'm not sure it needed to have been. [[Special:Contributions/172.70.86.116\|172.70.86.116]] 15:58, 4 February 2025 (UTC)

← Older revision		Revision as of 22:37, 2 September 2023
Line 33:		Line 33:

	There is no description of the breadth-first algorithm. Also while the third paragraph talks about brebth-first image, the reference to [[761: DFS]] which was added by [[User:BlackHat\|BlackHat]] is actually talking about breadth-first and not brebth-first. [[Special:Contributions/172.68.63.137\|172.68.63.137]] 18:37, 11 January 2021 (UTC)		There is no description of the breadth-first algorithm. Also while the third paragraph talks about brebth-first image, the reference to [[761: DFS]] which was added by [[User:BlackHat\|BlackHat]] is actually talking about breadth-first and not brebth-first. [[Special:Contributions/172.68.63.137\|172.68.63.137]] 18:37, 11 January 2021 (UTC)
		+
		+	now randall should also implement a toast search! [[User:An user who has no account yet\|An user who has no account yet]] ([[User talk:An user who has no account yet\|talk]]) 22:37, 2 September 2023 (UTC)

← Older revision		Revision as of 18:37, 11 January 2021
Line 31:		Line 31:

	[[Special:Contributions/172.68.132.19\|172.68.132.19]] 22:17, 8 January 2021 (UTC)Am I the only person that sees the deadth first search is a raptor?		[[Special:Contributions/172.68.132.19\|172.68.132.19]] 22:17, 8 January 2021 (UTC)Am I the only person that sees the deadth first search is a raptor?
		+
		+	There is no description of the breadth-first algorithm. Also while the third paragraph talks about brebth-first image, the reference to [[761: DFS]] which was added by [[User:BlackHat\|BlackHat]] is actually talking about breadth-first and not brebth-first. [[Special:Contributions/172.68.63.137\|172.68.63.137]] 18:37, 11 January 2021 (UTC)

← Older revision		Revision as of 22:17, 8 January 2021
Line 29:		Line 29:

	Can anyone write pseudocode for the brepth searches? I feel like there is a certain logic to it, but I'm unable to clearly articulate the recursion. Pseudocode seems infeasible for deadth-first, as the multiple visits make it fairly incomprehensible. [[User:Quantum7\|Quantum7]] ([[User talk:Quantum7\|talk]]) 08:44, 8 January 2021 (UTC)		Can anyone write pseudocode for the brepth searches? I feel like there is a certain logic to it, but I'm unable to clearly articulate the recursion. Pseudocode seems infeasible for deadth-first, as the multiple visits make it fairly incomprehensible. [[User:Quantum7\|Quantum7]] ([[User talk:Quantum7\|talk]]) 08:44, 8 January 2021 (UTC)
		+
		+	[[Special:Contributions/172.68.132.19\|172.68.132.19]] 22:17, 8 January 2021 (UTC)Am I the only person that sees the deadth first search is a raptor?

@@ Line 15: / Line 15: @@
 : I favour the latter (with maybe an aesthetic bias) as often when I run a tree-searching algorithm I like to randomly splice the next option out of the list of options (rather than run from first to last or last to first) where I am not aware of any advantageous link (maybe in ruling out 'dead' branches early to prune off useless branches early) and thus whatever natural sort-order the structure imposes would create biases.
 : Alternately, if continued it would definitely prioritise .2s down every .2(-dominant) branch, for a nicely symmetric 'wide-breadth first' pattern (.2.2.2 over .2.2.1, etc) for a pattern only visible once continued beyond the step currently shown. The root choice ''cannot'' be anything other than symmetry-breaking, but could as easily be a coinflip. [[Special:Contributions/141.101.98.68|141.101.98.68]] 00:32, 5 January 2021 (UTC)
 The top two drawings for "depth" and "breadth" are legitimate methods of listing out a tree structure. The next two drawings substitute the "d" and "br" from "depth" and "breadth" to get "brepth" and "deadth". The fifth drawing removes the "th" from "breadth" to get "bread". And the title text substitutes the "p" from "depth" with an "a" to get "death". [[User:Rtanenbaum|Rtanenbaum]] ([[User talk:Rtanenbaum|talk]]) 22:32, 4 January 2021 (UTC)

← Older revision		Revision as of 08:44, 8 January 2021
Line 25:		Line 25:

	I went ahead and tried to implement this on NPM https://www.npmjs.com/package/bread-first-search [[Special:Contributions/162.158.74.149\|162.158.74.149]] 19:30, 6 January 2021 (UTC)		I went ahead and tried to implement this on NPM https://www.npmjs.com/package/bread-first-search [[Special:Contributions/162.158.74.149\|162.158.74.149]] 19:30, 6 January 2021 (UTC)
		+	: This made me laugh! [[User:Quantum7\|Quantum7]] ([[User talk:Quantum7\|talk]]) 08:44, 8 January 2021 (UTC)
		+
		+	Can anyone write pseudocode for the brepth searches? I feel like there is a certain logic to it, but I'm unable to clearly articulate the recursion. Pseudocode seems infeasible for deadth-first, as the multiple visits make it fairly incomprehensible. [[User:Quantum7\|Quantum7]] ([[User talk:Quantum7\|talk]]) 08:44, 8 January 2021 (UTC)

← Older revision		Revision as of 19:30, 6 January 2021
Line 23:		Line 23:

	Somebody erased my commentary on deadth-first and hell regarding AI problems. These problems are real and people have experienced them firsthand. I notice the changes added in some heaven-references. I'm happy to add a much more pro-AI slant to the commentary; obviously AI makes lots of heaven, this is just not the _only_ thing that happens as people explore it. I don't think it's appropriate to leave information out, calling the brepth-first search more adaptive than the deadth-first search. It's pretty obvious from the dotted lines that the deadth-first search is adaptively considering its branches, and not revisiting nodes. I don't have the energy atm to start an actual edit war and add my information back in. [[Special:Contributions/108.162.219.74\|108.162.219.74]] 18:07, 6 January 2021 (UTC) EDIT: on closer review I see both exploration strategies have pretty deterministic behavior, and are quite poorly described by the commentary.		Somebody erased my commentary on deadth-first and hell regarding AI problems. These problems are real and people have experienced them firsthand. I notice the changes added in some heaven-references. I'm happy to add a much more pro-AI slant to the commentary; obviously AI makes lots of heaven, this is just not the _only_ thing that happens as people explore it. I don't think it's appropriate to leave information out, calling the brepth-first search more adaptive than the deadth-first search. It's pretty obvious from the dotted lines that the deadth-first search is adaptively considering its branches, and not revisiting nodes. I don't have the energy atm to start an actual edit war and add my information back in. [[Special:Contributions/108.162.219.74\|108.162.219.74]] 18:07, 6 January 2021 (UTC) EDIT: on closer review I see both exploration strategies have pretty deterministic behavior, and are quite poorly described by the commentary.
		+
		+	I went ahead and tried to implement this on NPM https://www.npmjs.com/package/bread-first-search [[Special:Contributions/162.158.74.149\|162.158.74.149]] 19:30, 6 January 2021 (UTC)

← Older revision		Revision as of 18:09, 6 January 2021
Line 22:		Line 22:
	I associated this comic with the way (non native english speakers like myself) tend to pronounce words like depth and breadth, especially during discussions about which tree traversal strategy to use. Then, using a term like breadth-first can easily degrade to dep-first and bread-first (skipping the harder-to-pronounce 'th'). So maybe add this as a possible background? [[Special:Contributions/162.158.159.50\|162.158.159.50]] 12:42, 5 January 2021 (UTC)		I associated this comic with the way (non native english speakers like myself) tend to pronounce words like depth and breadth, especially during discussions about which tree traversal strategy to use. Then, using a term like breadth-first can easily degrade to dep-first and bread-first (skipping the harder-to-pronounce 'th'). So maybe add this as a possible background? [[Special:Contributions/162.158.159.50\|162.158.159.50]] 12:42, 5 January 2021 (UTC)

−	Somebody erased my commentary on deadth-first and hell regarding AI problems. These problems are real and people have experienced them firsthand. I notice the changes added in some heaven-references. I'm happy to add a much more pro-AI slant to the commentary; obviously AI makes lots of heaven, this is just not the _only_ thing that happens as people explore it. I don't think it's appropriate to leave information out, calling the brepth-first search more adaptive than the deadth-first search. It's pretty obvious from the dotted lines that the deadth-first search is adaptively considering its branches, and not revisiting nodes. I don't have the energy atm to start an actual edit war and add my information back in. [[Special:Contributions/108.162.219.74\|108.162.219.74]] 18:07, 6 January 2021 (UTC)	+	Somebody erased my commentary on deadth-first and hell regarding AI problems. These problems are real and people have experienced them firsthand. I notice the changes added in some heaven-references. I'm happy to add a much more pro-AI slant to the commentary; obviously AI makes lots of heaven, this is just not the _only_ thing that happens as people explore it. I don't think it's appropriate to leave information out, calling the brepth-first search more adaptive than the deadth-first search. It's pretty obvious from the dotted lines that the deadth-first search is adaptively considering its branches, and not revisiting nodes. I don't have the energy atm to start an actual edit war and add my information back in. [[Special:Contributions/108.162.219.74\|108.162.219.74]] 18:07, 6 January 2021 (UTC) EDIT: on closer review I see both exploration strategies have pretty deterministic behavior, and are quite poorly described by the commentary.