Jump to content

A* search algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

27 May 2025

9 May 2025

8 May 2025

21 April 2025

18 April 2025

  • curprev 18:3618:36, 18 April 2025 Mwjunonn talk contribs m 44,297 bytes 0 Graph search should be the search technique which store the state that explored before. Tree-search (or tree-like search in AIMA) is the search technique that not checking any loopy or redundant path. This two term was exchange in this wiki. undo Tag: Visual edit

17 April 2025

16 April 2025

23 March 2025

8 March 2025

31 January 2025

26 January 2025

28 December 2024

20 December 2024

19 December 2024

26 November 2024

15 November 2024

2 November 2024

28 October 2024

25 October 2024

18 October 2024

12 October 2024

30 September 2024

24 September 2024

3 September 2024

28 June 2024

6 June 2024

4 June 2024

8 May 2024

29 April 2024

24 April 2024

  • curprev 14:4614:46, 24 April 2024 72.199.141.161 talk 39,254 bytes +195 The space complexity of the algorithm is listed in the second paragraph in terms of the undefined variables b and d. I copied the definition of these variables in the section titled Complexity to the second paragraph to avoid using undefined notation. undo Tag: Visual edit

6 April 2024

20 March 2024

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)