EDIT: I also got it to work by including an additional default (parameterless) constructor.

I had a lot of issues with this one trying to use a constructor to initialize the name property.

i.e, I had to remove:
public PersonEventArgs(string name)
{
Name = name;
}

And pass the name by doing:

ContactNotify?.Invoke(this, new PersonEventArgs(){Name=name});

Any attempt to pass name resulted in a CS7036 error depicting there was no parameter 'name' of 'PersonEventArgs.PersonEventArgs(string)'

C#: method name should be PascalCase (Please refer to implementation of backward compatibility here )

Actual and expected are swapped in PHP

I have a problem with randomTests, always one of the tests fails in the same way after 6-10 tests.

Env: PHP 8.0
Json of array elements $piecesPositionList

["E_Yellow","A_Red","C_Yellow","C_Red","G_Yellow","B_Red","D_Yellow","B_Red","A_Yellow","E_Red","A_Yellow","G_Red","G_Yellow","D_Red"]"

My result: Win:Yellow

Tests result:

Failed asserting that two strings are identical.
Expected: 'Red'
Actual  : 'Yellow'

The problems I see:

1. the tests are written in such a way that once in a while under the right assumptions of the algorithm this problem occurs. This is impossible to debug
2. my algorithm is too inefficient and causes phpunit error (this is unlikely)

Any possible suggestion of a solution is welcome.

C# initial code could mention that files are noted with a string and not a char

I run into a problem if the last move in the list is the winning move.

For theese moves:
(
[0] => C_Red
[1] => F_Yellow
[2] => G_Red
[3] => B_Yellow
[4] => F_Red
[5] => B_Yellow
[6] => D_Red
[7] => E_Yellow
[8] => G_Red
[9] => D_Yellow
[10] => D_Red
[11] => D_Yellow
[12] => C_Red
[13] => C_Yellow
[14] => D_Red
[15] => C_Yellow
[16] => B_Red
[17] => B_Yellow
)

Yellow is winning on the diagonal from B3 to E0.

But the test expects "Draw" not "Yellow".

C++ translation

This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/139.
Please join the discussion to help us identify duplicate kata and retire them.

Order matters, but is unspecified.

Use of random is not checked

C# function name should use PascalCase

Description should add example tests for more clarity too

It seems like the random tests don't guarantee one winner / stop when a winner is found. I tried checking for a winner after every move and after all turns had been made, but neither solution worked for me 100% of the time. I ended up getting my submission in by running my solution over and over again and eventually getting lucky. Was there some pattern that was supposed to be followed?

• Ruby 3.0 should be enabled (Refer this & this for more detail)