Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Conversation

@yceh
Copy link
Contributor

@yceh yceh commented Jul 12, 2022

It only includes nodes on the path from source to destination, excluding source and destination, because during the search phase we assume all moves will split the branch between the destination and the parent of the destination node, creating a new node. I am not sure how to pass this information to larch. (If it creates a zero-length branch, it will be cleaned up at the very end.)

Maybe wait until the larch team confirms it is useful to merge this?

@yatisht
Copy link
Owner

yatisht commented Jul 12, 2022

@matsen @willdumm @ognian- Please see the callback function in this PR to provide fully resolved MAT at the end of each matOptimize iteration. If you find this useful, we're happy to merge it in!

@yceh
Copy link
Contributor Author

yceh commented Jul 12, 2022

Sorry, this call back is not at the end of the iteration, is for each individual move (not even filtered by profitability). Following issue #252.

@yatisht
Copy link
Owner

yatisht commented Jul 12, 2022

Oh, sorry for the confusion! Perhaps we also need the one I described.

@yatisht yatisht merged commit de012d3 into yatisht:larch-dev Aug 28, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants