Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add/evaluate a choice of tie-breakers to the dancing links algorithm #13

Open
RichardMoot opened this issue Mar 23, 2015 · 2 comments
Open

Add/evaluate a choice of tie-breakers to the dancing links algorithm #13

RichardMoot opened this issue Mar 23, 2015 · 2 comments
Assignees
@RichardMoot
Labels
enhancement

Comments

@RichardMoot
Copy link
Owner

No description provided.

@RichardMoot
Copy link
Owner Author

One possible tie-breaker would be "commit", which, all other things being equal prefers nodes we have already connected (this would avoid back-and-forth between independent choices).

@RichardMoot
Copy link
Owner Author

Another possible tie-breaker would prefer the shorted distance between words in the graph (this would require more information to be stored at the atoms). This tie-breaker would be similar to the proof nets and human processing approaches of Johnson and Morrill

@RichardMoot RichardMoot self-assigned this Apr 8, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@RichardMoot RichardMoot

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@RichardMoot