WPC: Round 1 Individual - Welcome

[euklid]

1.2. ABCtje:

Is it safe to assume that in the competition puzzle there will be 15 letters - such that ALL numbers from 1 to 15 will be used?

Explanation of my question: In the example puzzle ALL the numbers from 1 to 10 are used. The example puzzle would have several solutions if, say, numbers 1 to 11 were allowed.

[euklid]

Snake Words 1: Does "Multiple words can start in same grey cell if and only if there are multiple arrows emanating from that cell" mean that the number of arrows must be same as the number of words starting?
By the wording of the condition I would assume that if 2 arrows emanate from a grey it should be allowed to have 3 or words starting in it, but that seems like a strange rule, hence my question.

Each combination of grey cell + arrow is used by exactly one word. There are no two words sharing the same first two letters.

Last Question applies to both "Snake Words" Puzzles: Do grey cells have to be filled? The condition "a letter in a grey cell must be the starting letter for at least one word", doesnt seem to forbid having empty grey cells, but the examples have none.

Grey cells are allowed to be empty.

Should it not be: Each combination of grey cell + arrow is used by at most one word?

Explanation: Since grey cells are allowed to be empty I would assume that such cells also have arrows (which are not used). Otherwise all grey cells without arrows are empty and all grey cells with arrows are filled.

[uvo]

1.2. ABCtje:

Is it safe to assume that in the competition puzzle there will be 15 letters - such that ALL numbers from 1 to 15 will be used?

Explanation of my question: In the example puzzle ALL the numbers from 1 to 10 are used. The example puzzle would have several solutions if, say, numbers 1 to 11 were allowed.

Yes, in the competition puzzle there will be 15 letters, and each letter appears in at least one word.

[uvo]

Snake Words 1: Does "Multiple words can start in same grey cell if and only if there are multiple arrows emanating from that cell" mean that the number of arrows must be same as the number of words starting?
By the wording of the condition I would assume that if 2 arrows emanate from a grey it should be allowed to have 3 or words starting in it, but that seems like a strange rule, hence my question.

Each combination of grey cell + arrow is used by exactly one word. There are no two words sharing the same first two letters.

Last Question applies to both "Snake Words" Puzzles: Do grey cells have to be filled? The condition "a letter in a grey cell must be the starting letter for at least one word", doesnt seem to forbid having empty grey cells, but the examples have none.

Grey cells are allowed to be empty.

Should it not be: Each combination of grey cell + arrow is used by at most one word?

Explanation: Since grey cells are allowed to be empty I would assume that such cells also have arrows (which are not used). Otherwise all grey cells without arrows are empty and all grey cells with arrows are filled.

Both my answers are correct. Grey cells are allowed to be empty, but as you noticed, in the first puzzle it won't happen.

[Schachus]

In that case, I really think that the rule "Each combination of grey cell + arrow is used by exactly one word" that you gave as an answer here should also be stated in the IB, because the difference to " Multiple words can start in the same grey cell if and only if there are multiple arrows emanating from that cell." as stated in the IB seems to be quite big.

[uvo]

Maybe so, but it is a bit late for that. I will mention it at the Q&A on Wednesday, of course.

Anyway, I think the situation is quite obvious when you see the puzzle. There are [number of grey cells] with [total number of arrows] which is equal to [number of words], just like in the example.