Skip to content

Comment on Show HN: Better Seater – Wedding seating chart optimizerparent

Comments

Yep, NP-hard! This is using an optimization engine. It's not brute forcing. But hopefully it's getting pretty good approximate results.

You can keep trying harder from the state, just click again on the Optimize buttons.

I admit, I haven't optimized the optimizer yet.

What do you mean by optimization engine? Did you write a solver yourself, or did you use something off-the-shelf? In either case, what are the algorithms involved?

I'm using Optaplanner as the engine under the covers, which is open source and off the shelf.

https://www.optaplanner.org/

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.