bernardosulzbach/wayout-player

Fails to solve some instances with twin tiles

Closed this issue · 1 comments

bernardosulzbach commented 
   D1 P1 D1   
D1    D1 D1 D1
C1 C1 C1 C1 C1
   D1 P1    D1
   P1 D1    P1

The following instance should be solved in 3 steps but currently takes 5. Identify the cause and write regression tests for it.

bernardosulzbach commented

This is the input 15dfd450887cc63bac77af18bd32b5b72b5859fbc14ab963ea4f8d525eac3723ec4a2c9fdc66f35e47a280a778f41f5b625c9133e2fdb5092967b8539affe24a and it now works.

   D1 P1 D1   
D1    D1 D1 D1
C1 C1 C1 C1 C1
   D1 P1    D1
   P1 D1    P1
Found an optimal solution:
  (0, 1)
  (1, 3)
  (4, 2)
Explored nodes: 19
Distinct nodes found: 148
Mean branching factor: 7.74
Used 6,536,000 B (7 MiB) of memory.