Talk:15 puzzle solver: Difference between revisions

m (→‎Using A* algorithm: changed an extremely long line (which used scrolling) to normal formatting, fixed a misspelling.)
Line 51:
 
Using the better heuristic used in the Python A* solution enables the solution of the task problem (using 4GB of memory). [[15 puzzle solver/20 Random]] has 20 random starting positions. Using the Python code starting positions requiring 1sec or more can not be solved on a computer with 8GB of memory. With 8GB it can test up to say 2200000 positions. So these solutions are good for extra credit medal with bar in the A* task but do not indicate that this is the correct algorithm to solve this task--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 17:25, 5 February 2019 (UTC)
 
==Edit undone==
User Kaviyarasu (their first/only contribution) changed the puzzle in the task description to
5 1 4 8
9 6 3 11
10 2 15 7
13 14 12 0
so I put it back. Obviously I have no problem with additional (/optional) puzzles, but the one all the existing contributions are using should not have been replaced. (Maybe I should have put this on their talk page, tl;dt) --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 21:06, 1 June 2020 (UTC)
7,806

edits