Puzzle #141: Japanese Sums

This weekend is the Japanese Sums Contest on Logic Masters Deutschland. It will feature 14 different Japanese Sums puzzles, one standard and 13 variants. All puzzles will use a 1~6 digit subset, instead of the 1~9 digit set I prefer. the 1~6 digit subset is most likely chosen as this leaves for puzzles that can be solved far quicker as Japanese Sums puzzles tend to take relatively long to solve. My puzzle therefore will not be the best practise for this test as it uses digits 1~9 but it's fun to solve.
On an unrelated note, all puzzle sets from the 24 hour puzzle championship are available on the WPF-forum. So if you have nothing to, that should give you plenty of puzzles to solve.

[Edit: Misclued number fixed in column 8]

Rules for Japanese Sums

Rules: Japanese Sums

Place the digits 1-9 in some of the squares, so that no digit is repeated in any row or column. Sums on the outside indicate the sums of consecutive digits in that row or column. Each sum is seperated by at least one empty square.

Croatian Puzzle Set

I had been asked to write a puzzle set for a competition in Zagreb last weekend. I wrote a set of puzzles which was a mix of Dutch and Japanese, familiar and unfamiliar, classic and simple variations. There's a lot of puzzle types in here that I havent actually posted on my blog before. The timing of the set was set at 75 minutes, which was longer than the fastest testing. But I have learned from earlier experiences that testing times don't always measure up to the actual test solving. I've added the scores for each puzzle, which equal to 2 points per minute. I think it worked out well, with a mix of easier and harder puzzles. If anyone actually solved them in copetition, I'd love to hear about it.

So here's 14 puzzles in a single post, the most I have done so far. I hope this makes up a bit for the hiatus of a month before. It would of course be easiest to just upload the PDF, but blogspot doesn't seem to offer that option. So instead this post will have all puzzles below.