Talk:A* search algorithm: Revision history

Article
Talk

View logs for this page (view filter log)

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 07:4107:41, 13 August 2006 Mikademus talk contribs 25,243 bytes +601 →The Pseudo-code undo

curprev 20:2920:29, 12 August 2006 Qwertyus talk contribs 24,642 bytes +402 →The Pseudo-code undo
curprev 19:4119:41, 12 August 2006 Regnaron~enwiki talk contribs 24,240 bytes +3,771 →The Pseudo-code: one more proposition undo

curprev 00:4400:44, 21 July 2006 Qwertyus talk contribs 15,067 bytes −48 →complexity undo
curprev 00:4400:44, 21 July 2006 Qwertyus talk contribs 15,115 bytes +455 →complexity undo

curprev 23:4923:49, 20 July 2006 82.31.166.12 talk 14,660 bytes +325 →complexity undo
curprev 23:3623:36, 20 July 2006 82.31.166.12 talk 14,335 bytes +815 →Intuition about why A* is not computationally optimal undo

curprev 17:2417:24, 14 July 2006 Regnaron~enwiki talk contribs 13,520 bytes +897 →complexity undo

curprev 04:0504:05, 11 July 2006 75.8.98.123 talk 12,623 bytes +85 complexity undo

curprev 21:0221:02, 6 July 2006 Hart~enwiki talk contribs 12,538 bytes +368 Intuition about why A* is not computationally optimal undo

curprev 21:1421:14, 26 May 2006 Regnaron~enwiki talk contribs 12,170 bytes +296 →Relation to uniform-cost search undo
curprev 14:1014:10, 26 May 2006 Qwertyus talk contribs 11,874 bytes +161 →Relation to uniform-cost search undo
curprev 13:1513:15, 26 May 2006 147.188.192.41 talk 11,713 bytes +239 →Relation to uniform-cost search undo
curprev 13:1413:14, 26 May 2006 147.188.192.41 talk 11,474 bytes +79 →Relation to uniform-cost search undo

curprev 18:4818:48, 22 May 2006 Regnaron~enwiki talk contribs 11,395 bytes +509 →Relation to uniform-cost search undo

curprev 20:0720:07, 8 May 2006 Rizome~enwiki talk contribs 10,886 bytes +394 "Uniform-cost search, aka Dijkstra's algorithm"? undo

curprev 02:1602:16, 7 March 2006 Hart~enwiki talk contribs 10,492 bytes +770 →how does it work undo

curprev 07:5007:50, 23 January 2006 Ruud Koot talk contribs 9,722 bytes −13 nah... undo
curprev 07:3107:31, 23 January 2006 Ruud Koot talk contribs 9,735 bytes +13 propose move undo

curprev 08:3208:32, 16 December 2005 Regnaron~enwiki talk contribs 9,722 bytes +895 →Rewriting of article undo
curprev 02:5002:50, 16 December 2005 Quuxplusone talk contribs 8,827 bytes +705 →Rewriting of article: commendable effort, but worse than the old English version undo

curprev 18:5918:59, 15 December 2005 Regnaron~enwiki talk contribs 8,122 bytes +122 →how does it work undo
curprev 18:5818:58, 15 December 2005 Regnaron~enwiki talk contribs 8,000 bytes +523 Rewriting of article undo

curprev 00:3000:30, 30 November 2005 66.192.104.10 talk 7,477 bytes +55 No edit summary undo
curprev 00:2900:29, 30 November 2005 66.192.104.10 talk 7,422 bytes +64 No edit summary undo

curprev 15:4715:47, 27 November 2005 Abdull talk contribs 7,358 bytes +216 how does it work undo

curprev 09:4509:45, 29 August 2005 Lee J Haywood talk contribs m 7,142 bytes +1 No edit summary undo
curprev 08:4808:48, 29 August 2005 Lee J Haywood talk contribs m 7,141 bytes +619 Is there an example? undo
curprev 03:2003:20, 29 August 2005 Rspeer talk contribs 6,522 bytes +382 →Monotonicity undo

curprev 19:1319:13, 28 August 2005 Lee J Haywood talk contribs 6,140 bytes +560 Monotonicity undo

curprev 13:5513:55, 19 July 2005 206.106.168.10 talk 5,580 bytes +990 No edit summary undo

curprev 20:0720:07, 25 January 2005 Hart~enwiki talk contribs 4,590 bytes +692 →Why is A* admissible and optimal? undo
curprev 19:5919:59, 25 January 2005 Hart~enwiki talk contribs 3,898 bytes +41 Why is A* admissible and optimal? undo

curprev 19:2319:23, 27 December 2004 Rspeer talk contribs 3,857 bytes +205 →Admissible heuristics: I feel a bit silly now. undo

curprev 18:0418:04, 26 December 2004 Rspeer talk contribs 3,652 bytes +483 →Admissible heuristics undo
curprev 17:5317:53, 26 December 2004 Rspeer talk contribs 3,169 bytes +398 →Bogus link: - the Google test is what has failed here. undo
curprev 14:2014:20, 26 December 2004 80.178.224.195 talk 2,771 bytes +163 →Bogus link undo

curprev 08:0608:06, 25 December 2004 Rspeer talk contribs 2,608 bytes +1,615 misinformation about what is required in an admissible heuristic undo

curprev 21:5521:55, 17 November 2004 ZeroOne talk contribs 993 bytes +113 A* undo

curprev 15:3215:32, 12 December 2003 Frecklefoot talk contribs 880 bytes +237 reason for removal of link undo

curprev 22:1122:11, 30 April 2003 Bart Massey talk contribs 643 bytes +174 No edit summary undo

curprev 20:4520:45, 31 January 2003 Frecklefoot talk contribs 469 bytes +469 A star is wrong for A*

Retrieved from "https://en.wikipedia.org/wiki/Talk:A*_search_algorithm"