Timeline for Shortest path for a knight
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2014 at 15:43 | comment | added | chaosflaws | Well, in your head, you're building graphsto find out by basically doing breadth-first. There's quite a bit of intuition connected to it, of course. If this is what you are aiming at, I may change the answer. | |
| Mar 19, 2014 at 14:01 | comment | added | pim999 | This does not really answer my question. My question is on how a human player compute the shortest path (without or with other pieces on the board). Your answer is about how a computer would answer the question. I might be wrong but I don't think that a human chess player build the graph in order to search for a path. Beside, I don't think that the shortest path with other pieces relates to a Travelling Salesman problem. I think that even in this case it should be a Breadth-first search, so it is far less complex than the travelling salesman. | |
| Mar 19, 2014 at 1:47 | history | answered | chaosflaws | CC BY-SA 3.0 |