Triankle Sudoku rules:
The numbers are from 0 to 9.
There are 8 triangular nonets covering twelve rows and 11 columns.
The two numbers in the centre two grey cells repeat horizontally and vertically. I.e. in row six there are eleven numbers so nine different numbers with the grey number twice and row seven the same. In column 6 there are 12 numbers eight different numbers with the two grey numbers twice.
The other eight numbers do not repeat anywhere.
The repeating numbers are present in every nonet.
Each of the other eight numbers is absent in one and only one nonet.
Semi-symmetric is not an absolute necessity but given that it fits very well, I will be using it in all my early puzzles. So Semi-symmetric.
There are five pairs of numbers which are unknown.
If a cell contains a number the opposite cell must contain it or its partner.
These can be put together in JSudoku. If anyone wants guidance on how to do it I will post how.
Triankle Vanilla 3
If you wish to solve in JSudoku:
open as a 12 by 12 Latin Square from 0 - B
enter the eight nonets as killer cages with no sum (c, then choose operator "none")
select a cell in C6: ctrl right click select remove and then C6
select a cell in R6: ctrl right click select remove and then R6
select a cell in R7: ctrl right click select remove and then R6 (JS has renumbered the rows)
select all the nonet cells shift A then shift B to remove the A & B pencilmarks
do a set of solves to put A B in every cell around the diamond.
select r67c6 as a twin killer cage with no sum (twin killer is easier to see)
select r6 c1-5 & c7-11 as a twin killer cage 45/10
select r7 c1-5 & c7-11 as a twin killer cage 45/10
select r1-5&r8-12 c6 as a twin killer cage 45/10
Save as your TRIANKLE BASE
