IWETHEY v. 0.3.0
|
TODO
1,095 registered users | 0
active users
| 0 LpH |
Statistics
Login
|
Create New User
Welcome to IWETHEY!
IWETHEY Home
/
IWETHEY Board
/
Theory and Practice of Programming Forum
/
Idea
Post #88,881
by
drewk
3/17/03 5:32:36 PM
Reply
Idea
Calculate all the possible positions from which you can jump to the last position. When you calculate your shortest path, get the shortest path to
any
of the positions and take that one.
===
Implicitly condoning stupidity since 2001.
Knight's Path and Knight's Tour
- (
jake123
)
- (10)
- March 14, 2003, 09:53:28 PM EST
Idea
- (
drewk
)
- March 17, 2003, 05:32:36 PM EST
Heuristic for Knight's Tour
- (
ben_tilly
)
- (7)
- March 18, 2003, 03:05:06 PM EST
Works great for knight's circuit as well :-)
- (
ben_tilly
)
- (6)
- March 19, 2003, 12:20:03 AM EST
I'm thinking more along the lines of...
- (
tseliot
)
- (5)
- March 19, 2003, 01:20:06 AM EST
That is a blind alley
- (
ben_tilly
)
- (4)
- March 19, 2003, 10:39:10 AM EST
A few moves I don't get
- (
drewk
)
- (1)
- March 19, 2003, 10:48:03 AM EST
Trivial
- (
ben_tilly
)
- March 19, 2003, 11:30:45 AM EST
Sorry, I should've replied higher up.
- (
tseliot
)
- (1)
- March 19, 2003, 11:55:55 AM EST
Ah...
- (
ben_tilly
)
- March 19, 2003, 01:12:14 PM EST
I'm paying attention
- (
jake123
)
- March 18, 2003, 05:06:16 PM EST
i
we
they
.org
Good thing it smells like Kung Pao Tofu instead of like Greg's ears.
35 ms