LÖVE

louie999 wrote:I have another set of questions, about lua-enet , how can I make players control their character with lua-enet?
like:
host created
player 1 joins
player 2 joins
...
Then each player can control 1 unit/character, like player 1 can control unit1, player 2 controls unit2 etc. will peer:connect_id() suffice for that? or is there a complicated approach I need to do to achieve that?

Is it possible to create a lobby or something similar where players can see all the created rooms/host then they can connect to it by simply pressing a "Connect" button ?

How can I update everything that's happening in the game to all the connected clients of a enet host? like if player 1 moved his unit or using a weapon/firing then the other players can see it too. Or if player 1 shoots then when the projectile hits a player then that player will see that he got hit. I hope someone can help me with these things as it's hard as hell for me

Grubby wrote:Develop games for what target resolution?

The title says it all. What resolution do most of you target? Do you shoot for widescreen 16:9/16:10 -> (1280x720 or 1920x1080) or do you go for 4:3 -> (1024x768 or 1280x1024) I'd assume by default, that most modern monitors cater to widescreen.

Just curious...

local shuffleRNG = love.math.newRandomGenerator(seed)
function shuffle(t)
    for i = #t, 2, -1 do
        local j = shuffleRNG:random(1, i)
        t[i], t[j] = t[j], t[i]
    end
end

A variant of the above method that has seen some use in languages that support sorting with user-specified comparison functions is to shuffle a list by sorting it with a comparison function that returns random values. However, this is an extremely bad method: it is very likely to produce highly non-uniform distributions, which in addition depends heavily on the sorting algorithm used.

[...]

In principle this shuffling method can even result in program failures like endless loops or access violations, because the correctness of a sorting algorithm may depend on properties of the order relation (like transitivity) that a comparison producing random values will certainly not have. While this kind of behaviour should not occur with sorting routines that never perform a comparison whose outcome can be predicted with certainty (based on previous comparisons), there can be valid reasons for deliberately making such comparisons. For instance the fact that any element should compare equal to itself allows using them as sentinel value for efficiency reasons, and if this is the case, a random comparison function would break the sorting algorithm.

Jasoco wrote:I didn't want to create a thread for a simple question like this.

Why doesn't this code work?

Code: Select all

local shuffleRNG = love.math.newRandomGenerator(seed)
function shuffle(t)
	table.sort(t, function(a, b) return shuffleRNG:random() > 0.5 end)
end

If I use normal math.random() instead, it works fine. But if I use the love.math RNG, it errors with a "Invalid sort function" message.

I thought I could create a simple shuffle function, but I guess I'll use a more complex version from online that will probably work fine with the love.math RNG stuff.

local shuffleRNG = {}
math.randomseed(os.time())
shuffleRNG.random = function(self) return math.random() end
function shuffle(t)
   table.sort(t, function(a, b)
local r = shuffleRNG:random()
local d = r > 0.5
print(a,b,r,d)
return d end)
end
local tbl = {4,2,5,3}
shuffle(tbl)
for i,v in ipairs(tbl) do print(i,v) end