However, even for unsolvable layouts, the depth of the search tree can reflect a kind of difficulty. If a layout is not solvable then in one sense it's infinitely difficult. Let's consider this case first: Unsolvable Layouts
does a sequence of legal moves exist that results in a win) is obviously key. If, for our purposes, we use a rough definition along the lines of, "how much time the average player spends on a layout", then there are a few interesting things we can say about the relationship between a layout's difficulty and its general features.Īs your first point suggests, the solvability of the layout (i.e. From a human perspective I suppose one's interpretation of difficulty is quite subjective: what one person might find difficult another may find easy.
0 kommentar(er)
