#############
#...........#
###D#C#D#B###
#D#C#B#A#
#D#B#A#C#
#C#A#A#B#
#########
#############
#B..........#
###D#C#D#.###
#D#C#B#A#
#D#B#A#C#
#C#A#A#B#
#########
#############
#BA.......BC#
###D#C#D#.###
#D#C#B#.#
#D#B#A#.#
#C#A#A#.#
#########
---
#############
#BA.......BC#
###.#C#.#D###
#.#C#B#D#
#.#B#A#D#
#C#A#A#D#
#########
---
#############
#B......C.BC#
###.#C#.#D###
#.#C#B#D#
#.#B#A#D#
#A#A#A#D#
#########
#############
#BB.....C.BC#
###.#C#.#D###
#A#C#.#D#
#A#B#.#D#
#A#A#.#D#
#########
---
#############
#BB...B...BC#
###A#.#.#D###
#A#.#C#D#
#A#.#C#D#
#A#.#C#D#
#########
Finally got my stars, I built workflows but had to hardcode some things so that it would finish. Given infinite resources, the logic would work for all paths, but it clearly needed some guiding to finish in a reasonable time.
Brute force by hand p1 and p2. P2 below by hand. I used alteryx for the sum/calculations
#############
#...........#
###D#A#A#D###
###D#C#B#A###
###D#B#A#C###
###C#C#B#B###
#########
A up 1;
A left 4;
A up 1;
A right 4;
D up 1;
D right 2;
A up 2;
A left 7;
B up 2;
B right 1;
C up 2;
C right 2;
C down 4;
B up 3;
B left 1;
C up 4;
C right 2;
C down 3;
B right 1;
B down 4;
B left 3;
B down 3;
B left 5;
B down 2;
D up 1;
D left 5;
A up 2;
A right 1;
C up 3;
C left 2;
C down 1;
B up 4;
B left 4;
B down 1;
D right 5;
D down 4;
D up 1;
D right 6;
D down 3
D up 2;
D right 6;
D down 2;
D up 3;
D right 6;
D down 1;
C up 4;
C right 4;
C down 1;
A right 1;
A down 4;
A right 2;
A down 3;
A left 7;
A down 2;
A left 8
A down 1;
i built an excel macro to do it (attached), similar to hand and paper, but faster.
way to use the macro.
1. Click the start button.
2. in the game area, use mouse to click the token want to move.
3. then press direction key to move (i.e. up, down, left, right key)
*to restart, click the start button again.
**it change the function of direction key. hence, click STOP to stop the game. (No resume)
***the shortest answer and answer need to manual copy.
I made it!!
Both within 5mins.
part 2 is take less time then part1, without do anything change.
Macro:
output:
part1: 4-6mins
part2:
This one took me a month part-time to get this finalised.
Went through a ton of different things - details below:
The main recipe:
- Create the matrix of all the possible moves (do this once) - and the positions that it goes through to get there.
- Start with the starting position:
- Match with the move matrix to find the possible moves in step 1
- Exclude any where the path is blocked; or where it breaks the rules
- Whateever remains then becomes part of the next iteration
... continue doing this until you hit the target end-state