You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There could be a switch that would ensure that really different layouts would be outputted. There should also be a matric that would take the total number of rooms into account when deciding whether two layouts are different enough.
What does it mean that layouts are different enough? We are doing a depth-first search with backtracking so it is very likely that all the layouts will be different but also have a few common chains. Is it ok? Or should we start a completely new run of the algorithm to ensure that no two chains are the same? Or is it enough to sometimes perturb a node that is not currently in the last chain? Or should we try to choose a chain at random and perturb it? Will it converge?
Steps to reproduce
None.
Actual results
Layouts have a lot in common.
Expected results
None.
Notes for the thesis
None.
The text was updated successfully, but these errors were encountered:
Description
There could be a switch that would ensure that really different layouts would be outputted. There should also be a matric that would take the total number of rooms into account when deciding whether two layouts are different enough.
What does it mean that layouts are different enough? We are doing a depth-first search with backtracking so it is very likely that all the layouts will be different but also have a few common chains. Is it ok? Or should we start a completely new run of the algorithm to ensure that no two chains are the same? Or is it enough to sometimes perturb a node that is not currently in the last chain? Or should we try to choose a chain at random and perturb it? Will it converge?
Steps to reproduce
None.
Actual results
Layouts have a lot in common.
Expected results
None.
Notes for the thesis
None.
The text was updated successfully, but these errors were encountered: