SVSim/SVSimServer
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

feat(battle-node): per-battle master seed + node-side deck shuffle

Browse Source 
GetOrSeedDeckMap now seeds from a Fisher-Yates shuffle of the deck keyed by the
per-battle MasterSeed, so the reveal map and the wire selfDeck share one
shuffled order. Updated the existing build-order test to the shuffle semantics.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
This commit is contained in:
gamer147
2026-06-04 18:14:14 -04:00
parent 11c98bf67b
commit 6f7fcfe28e
2 changed files with 81 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
SVSim.UnitTests/BattleNode/Sessions/BattleSessionStateTests.cs
View File

@@ -27,17 +27,21 @@ public class BattleSessionStateTests
FieldId: 0, IsOfficial: 0, BattleType: 11);
[Test]
public void GetOrSeedDeckMap_maps_idx_1based_to_deck_cardIds()
public void GetOrSeedDeckMap_maps_idx_1based_to_the_shuffled_order()
{
var state = new BattleSessionState();
// The map seeds from GetShuffledDeck, not raw build order. idx (i+1) -> shuffledDeck[i],
// and the set of cardIds is unchanged (1..3 present, 4 absent).
var state = new BattleSessionState(masterSeed: 12345);
var p = new StubParticipant(1, Ctx(900L, 901L, 902L));
var shuffled = state.GetShuffledDeck(p);
var map = state.GetOrSeedDeckMap(p);
Assert.That(map[1], Is.EqualTo(900L));
Assert.That(map[2], Is.EqualTo(901L));
Assert.That(map[3], Is.EqualTo(902L));
Assert.That(map[1], Is.EqualTo(shuffled[0]));
Assert.That(map[2], Is.EqualTo(shuffled[1]));
Assert.That(map[3], Is.EqualTo(shuffled[2]));
Assert.That(map.ContainsKey(4), Is.False);
Assert.That(new[] { map[1], map[2], map[3] }, Is.EquivalentTo(new[] { 900L, 901L, 902L }));
}
[Test]
@@ -47,4 +51,43 @@ public class BattleSessionStateTests
var p = new StubParticipant(1, Ctx(900L));
Assert.That(state.GetOrSeedDeckMap(p), Is.SameAs(state.GetOrSeedDeckMap(p)));
}
[Test]
public void GetShuffledDeck_is_a_permutation_of_the_input()
{
var state = new BattleSessionState(masterSeed: 12345);
var p = new StubParticipant(1001, Ctx(DistinctDeck()));
Assert.That(state.GetShuffledDeck(p), Is.EquivalentTo(DistinctDeck()),
"same multiset of cards, just reordered");
}
[Test]
public void GetShuffledDeck_actually_reorders_a_distinct_deck()
{
var state = new BattleSessionState(masterSeed: 12345);
var p = new StubParticipant(1001, Ctx(DistinctDeck()));
Assert.That(state.GetShuffledDeck(p), Is.Not.EqualTo(DistinctDeck()),
"a 30-card distinct deck should not survive the shuffle in original order");
}
[Test]
public void GetShuffledDeck_is_deterministic_for_same_master_seed_and_viewer()
{
var a = new BattleSessionState(masterSeed: 777).GetShuffledDeck(new StubParticipant(1001, Ctx(DistinctDeck())));
var b = new BattleSessionState(masterSeed: 777).GetShuffledDeck(new StubParticipant(1001, Ctx(DistinctDeck())));
Assert.That(a, Is.EqualTo(b));
}
[Test]
public void GetShuffledDeck_differs_across_master_seeds()
{
var a = new BattleSessionState(masterSeed: 1).GetShuffledDeck(new StubParticipant(1001, Ctx(DistinctDeck())));
var b = new BattleSessionState(masterSeed: 2).GetShuffledDeck(new StubParticipant(1001, Ctx(DistinctDeck())));
Assert.That(a, Is.Not.EqualTo(b));
}
private static long[] DistinctDeck() =>
Enumerable.Range(1, 30).Select(i => 200_000_000L + i).ToArray();
}