DDraceNetwork - developer

Chairn

he's actually my brother but he's no longer active on tw (but still alive :))

Ah :)

Chairn

why you looking for him ? ts server is probably outdated but i think it's still running

Yes, that's what I wanted to ask. The TS server is offline (for quite awhile too I believe)

integer2bit

[ddnet/ddnet] Pull request opened: #8157 add windows installation with scoop

Provide a convenient way to install and update ddnet on windows.

Checklist

!Screenshot

[x] Tested the change ingame
[x] Provided screenshots if it is a visual change
[x] Tested in combination with possibly related configuration options
[x] Written a unit test (especially base/) or added coverage to integration test
[x] Considered possible null pointers and out of bounds array in...

Which one? I made like x versions of that game. None of them are interesting btw. You control an ascii hashtag left and right…

Replying to @MilkeeyCat chillerdragon: how to play chidraqul xDDDD

chillerdragon: one made with rust doesn't work for me

06:01

When i connect to server and press a it just moves to left all the time

06:02

And one in c++ i had to include different header file and add other lib to linker to make it work xd

07:55

@TsFreddie r u gen z

i'm millennials i think

07:56

chinese counts generation a bit differently but I think i'm on the edge of millennials

public bool -> lowkey fax

def-

[ddnet/ddnet] Pull request closed: #8157 add windows installation with scoop

07:57

github-merge-queue[bot]

[ddnet:master] 2 new commits

707240e add windows installation with scoop - integer2bit 1147d28 Merge pull request #8157 from integer2bit/master - def-

Ryozuki

Click to see attachment 🖼️

veri good

https://en.wikipedia.org/wiki/Lehmer_random_number_generator

Lehmer random number generator

The Lehmer random number generator (named after D. H. Lehmer), sometimes also referred to as the Park–Miller random number generator (after Stephen K. Park and Keith W. Miller), is a type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The general formula is Xk+1=a⋅Xkmodm,{\displaystyle X_{k+1}...

Ryozuki

@TsFreddie r u gen z

bruh I thought I was still in #off-topic

Ryozuki

https://en.wikipedia.org/wiki/Lehmer_random_number_generator

LCGs are usually badly behaved. Is this one any different? (edited)

@Learath2 idk but found it interesting how simple it is

Ryozuki

@Learath2 idk but found it interesting how simple it is

All LCGs are rather simple. The only difference this has seems to be that c = 0

08:32

It is quite bizarre how seemingly unpredictable and random it becomes though yeah

Given the dynamic nature of the area, it is difficult for nonspecialists to make decisions about what generator to use. "Give me something I can understand, implement and port... it needn't be state-of-the-art, just make sure it's reasonably good and efficient." Our article and the associated minimal standard generator was an attempt to respond to this request. Five years later, we see no need to alter our response other than to suggest the use of the multiplier a = 48271 in place of 16807.

08:34

nice quote

08:36

uint32_t lcg_parkmiller(uint32_t *state)
{
    return *state = (uint64_t)*state * 48271 % 0x7fffffff;
}

Ryozuki

Given the dynamic nature of the area, it is difficult for nonspecialists to make decisions about what generator to use. "Give me something I can understand, implement and port... it needn't be state-of-the-art, just make sure it's reasonably good and efficient." Our article and the associated minimal standard generator was an attempt to respond to this request. Five years later, we see no need to alter our response other than to suggest the use of the multiplier a = 48271 in place of 16807.

Xorshift is almost as simple, much better behaved and better performant

u can avoid the div

08:38

uint32_t lcg_parkmiller(uint32_t *state)
{
    uint64_t product = (uint64_t)*state * 48271;
    uint32_t x = (product & 0x7fffffff) + (product >> 31);

    x = (x & 0x7fffffff) + (x >> 31);
    return *state = x;
}

Yeah without the div it probably performs about the same

Ryozuki

Click to see attachment 🖼️

Anything better than an LCG or xorshift is usually far too complex (PCG) or far too heavy (Arc4Random, Mersenne Twister, Fortuna)

C:/msys64/home/Melanin_m/SkyBlock/ddnet_SkyBlock/src/engine/server/server.cpp: In member function 'void CServer::UpdateDebugDummies(bool)':
C:/msys64/home/Melanin_m/SkyBlock/ddnet_SkyBlock/src/engine/server/server.cpp:2690:39: error: 'class IGameServer' has no member named 'm_apPlayers'
 2690 |                         GameServer()->m_apPlayers[ClientID]->m_IsDebugDummy = true;

რილია

C:/msys64/home/Melanin_m/SkyBlock/ddnet_SkyBlock/src/engine/server/server.cpp: In member function 'void CServer::UpdateDebugDummies(bool)':
C:/msys64/home/Melanin_m/SkyBlock/ddnet_SkyBlock/src/engine/server/server.cpp:2690:39: error: 'class IGameServer' has no member named 'm_apPlayers'
 2690 |                         GameServer()->m_apPlayers[ClientID]->m_IsDebugDummy = true;

why i can't access to GameServer()->m_apPlayers[ClientID] in server.cpp ? (edited)

09:31

i want to add some bots to my server and update they inputs accordingly, but first i want to detect which one is debug dummy (edited)

if it’s a private or protected member you cannot access it