Compare commits
15 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 5b277601ea | |||
| 418e422f12 | |||
| bc2d1b126e | |||
| 08e8656ecf | |||
| 73ffef76b0 | |||
| 0a34deb630 | |||
| bc05bbdc50 | |||
| f9012b01c4 | |||
| e18e242eae | |||
| 576489c226 | |||
| 90f8fe2e77 | |||
| 7f708df327 | |||
| 6bfa05c292 | |||
| da0dfe98c4 | |||
| b840d56725 |
Generated
+9
@@ -132,6 +132,15 @@ dependencies = [
|
|||||||
"rand",
|
"rand",
|
||||||
]
|
]
|
||||||
|
|
||||||
|
[[package]]
|
||||||
|
name = "klondike-bench"
|
||||||
|
version = "0.1.0"
|
||||||
|
dependencies = [
|
||||||
|
"card_game",
|
||||||
|
"klondike",
|
||||||
|
"rand",
|
||||||
|
]
|
||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "klondike-cli"
|
name = "klondike-cli"
|
||||||
version = "0.1.0"
|
version = "0.1.0"
|
||||||
|
|||||||
@@ -2,6 +2,7 @@
|
|||||||
members = [
|
members = [
|
||||||
"card_game",
|
"card_game",
|
||||||
"klondike",
|
"klondike",
|
||||||
|
"klondike-bench",
|
||||||
"klondike-cli",
|
"klondike-cli",
|
||||||
]
|
]
|
||||||
resolver = "3"
|
resolver = "3"
|
||||||
|
|||||||
@@ -10,3 +10,6 @@ keywords = ["card", "cards", "solitaire", "klondike"]
|
|||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
arrayvec = "0.7.6"
|
arrayvec = "0.7.6"
|
||||||
|
|
||||||
|
[lints]
|
||||||
|
workspace = true
|
||||||
|
|||||||
+90
-22
@@ -6,10 +6,10 @@ struct ReadmeDoctests;
|
|||||||
use core::ops::RangeBounds;
|
use core::ops::RangeBounds;
|
||||||
|
|
||||||
// TODO: pub struct ValidInstruction<I>(I);
|
// TODO: pub struct ValidInstruction<I>(I);
|
||||||
pub trait Game {
|
pub trait Game: Clone + core::fmt::Debug {
|
||||||
type Stats;
|
type Stats: Clone + core::fmt::Debug;
|
||||||
type Config;
|
type Config: Clone + core::fmt::Debug;
|
||||||
type Instruction;
|
type Instruction: Clone + core::fmt::Debug;
|
||||||
fn possible_instructions(&self) -> impl Iterator<Item = Self::Instruction> + use<Self>;
|
fn possible_instructions(&self) -> impl Iterator<Item = Self::Instruction> + use<Self>;
|
||||||
fn is_instruction_valid(&self, config: &Self::Config, instruction: Self::Instruction) -> bool;
|
fn is_instruction_valid(&self, config: &Self::Config, instruction: Self::Instruction) -> bool;
|
||||||
fn process_instruction(
|
fn process_instruction(
|
||||||
@@ -321,21 +321,36 @@ impl<S> SessionStats<S> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
pub struct Oom;
|
||||||
|
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
pub struct Session<G: Game> {
|
pub struct Session<G: Game> {
|
||||||
stats: SessionStats<G::Stats>,
|
stats: SessionStats<G::Stats>,
|
||||||
config: G::Config,
|
config: G::Config,
|
||||||
state: SessionState<G>,
|
state: SessionState<G>,
|
||||||
}
|
}
|
||||||
#[derive(Clone, Eq, Hash, PartialEq)]
|
#[derive(Clone, Debug)]
|
||||||
pub struct SessionState<G: Game> {
|
pub struct StateSnapshot<G: Game> {
|
||||||
seed: G,
|
|
||||||
state: G,
|
state: G,
|
||||||
history: Vec<G::Instruction>,
|
instruction: G::Instruction,
|
||||||
|
}
|
||||||
|
impl<G: Game> StateSnapshot<G> {
|
||||||
|
pub const fn state(&self) -> &G {
|
||||||
|
&self.state
|
||||||
|
}
|
||||||
|
pub const fn instruction(&self) -> &G::Instruction {
|
||||||
|
&self.instruction
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
|
pub struct SessionState<G: Game> {
|
||||||
|
state: G,
|
||||||
|
history: Vec<StateSnapshot<G>>,
|
||||||
}
|
}
|
||||||
impl<G: Game + Clone> SessionState<G> {
|
impl<G: Game + Clone> SessionState<G> {
|
||||||
fn new(state: G) -> Self {
|
fn new(state: G) -> Self {
|
||||||
Self {
|
Self {
|
||||||
seed: state.clone(),
|
|
||||||
state,
|
state,
|
||||||
history: Vec::new(),
|
history: Vec::new(),
|
||||||
}
|
}
|
||||||
@@ -345,6 +360,7 @@ impl<G: Game> Session<G>
|
|||||||
where
|
where
|
||||||
G: Clone + Eq + core::hash::Hash,
|
G: Clone + Eq + core::hash::Hash,
|
||||||
G::Stats: Clone + Default,
|
G::Stats: Clone + Default,
|
||||||
|
G::Config: Clone,
|
||||||
G::Instruction: Clone + Eq + core::hash::Hash,
|
G::Instruction: Clone + Eq + core::hash::Hash,
|
||||||
{
|
{
|
||||||
pub fn new(state: G, config: G::Config) -> Self {
|
pub fn new(state: G, config: G::Config) -> Self {
|
||||||
@@ -369,7 +385,7 @@ where
|
|||||||
pub const fn config(&self) -> &G::Config {
|
pub const fn config(&self) -> &G::Config {
|
||||||
&self.config
|
&self.config
|
||||||
}
|
}
|
||||||
pub fn history(&self) -> &[G::Instruction] {
|
pub fn history(&self) -> &[StateSnapshot<G>] {
|
||||||
&self.state.history
|
&self.state.history
|
||||||
}
|
}
|
||||||
pub fn undo(&mut self) {
|
pub fn undo(&mut self) {
|
||||||
@@ -389,12 +405,67 @@ where
|
|||||||
pub fn is_win(&self) -> bool {
|
pub fn is_win(&self) -> bool {
|
||||||
self.state.is_win()
|
self.state.is_win()
|
||||||
}
|
}
|
||||||
|
pub fn is_winnable(&self) -> Result<Option<Vec<StateSnapshot<G>>>, Oom> {
|
||||||
|
const HUGE_CAP: usize = 1 << 25;
|
||||||
|
let mut state_moves = std::collections::HashMap::with_capacity(HUGE_CAP);
|
||||||
|
let mut state = self.clone();
|
||||||
|
while !state.is_win() {
|
||||||
|
// don't look for empty hash map buckets when the hash map is 99% full!
|
||||||
|
if HUGE_CAP * 127 <= state_moves.len() * 128 {
|
||||||
|
return Err(Oom);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Continue existing iterator if it exists
|
||||||
|
let it = state_moves
|
||||||
|
.entry(state.state().clone())
|
||||||
|
.or_insert_with(|| state.state().possible_instructions());
|
||||||
|
|
||||||
|
// Run one possible move
|
||||||
|
if let Some(instruction) = it.next() {
|
||||||
|
state.process_instruction(instruction);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// No more moves. If we can't undo we're done
|
||||||
|
if state.history().is_empty() {
|
||||||
|
return Ok(None);
|
||||||
|
} else {
|
||||||
|
state.undo();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// history includes cycles
|
||||||
|
let mut state_index: std::collections::HashMap<_, _> = state
|
||||||
|
.history()
|
||||||
|
.iter()
|
||||||
|
.enumerate()
|
||||||
|
.map(|(i, snapshot)| (snapshot.state().clone(), i))
|
||||||
|
.collect();
|
||||||
|
|
||||||
|
// find the longest range where the start and end are the same state
|
||||||
|
while let Some(longest_range) = state
|
||||||
|
.history()
|
||||||
|
.iter()
|
||||||
|
.enumerate()
|
||||||
|
.filter_map(|(index, snapshot)| {
|
||||||
|
let &last_index = state_index.get(snapshot.state())?;
|
||||||
|
let longness = last_index - index;
|
||||||
|
(longness != 0).then_some(index..last_index)
|
||||||
|
})
|
||||||
|
.max_by_key(|range| range.len())
|
||||||
|
{
|
||||||
|
state.state.history.drain(longest_range);
|
||||||
|
for (i, snapshot) in state.history().iter().enumerate() {
|
||||||
|
state_index.insert(snapshot.state().clone(), i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(Some(state.state.history))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
impl<G: Game> Game for SessionState<G>
|
impl<G: Game> Game for SessionState<G>
|
||||||
where
|
where
|
||||||
G: Clone,
|
|
||||||
G::Stats: Default,
|
G::Stats: Default,
|
||||||
G::Instruction: Clone,
|
|
||||||
{
|
{
|
||||||
type Stats = SessionStats<G::Stats>;
|
type Stats = SessionStats<G::Stats>;
|
||||||
type Config = G::Config;
|
type Config = G::Config;
|
||||||
@@ -420,19 +491,16 @@ where
|
|||||||
) {
|
) {
|
||||||
match instruction {
|
match instruction {
|
||||||
SessionInstruction::Undo => {
|
SessionInstruction::Undo => {
|
||||||
// replay the entire history of the game except one move
|
if let Some(snapshot) = self.history.pop() {
|
||||||
self.history.pop();
|
self.state = snapshot.state;
|
||||||
let mut inner_stats = G::Stats::default();
|
stats.increment_undos();
|
||||||
let mut state = self.seed.clone();
|
|
||||||
for instruction in &self.history {
|
|
||||||
state.process_instruction(&mut inner_stats, config, instruction.clone());
|
|
||||||
}
|
}
|
||||||
self.state = state;
|
|
||||||
stats.inner_stats = inner_stats;
|
|
||||||
stats.increment_undos();
|
|
||||||
}
|
}
|
||||||
SessionInstruction::InnerInstruction(instruction) => {
|
SessionInstruction::InnerInstruction(instruction) => {
|
||||||
self.history.push(instruction.clone());
|
self.history.push(StateSnapshot {
|
||||||
|
state: self.state.clone(),
|
||||||
|
instruction: instruction.clone(),
|
||||||
|
});
|
||||||
self.state
|
self.state
|
||||||
.process_instruction(&mut stats.inner_stats, config, instruction);
|
.process_instruction(&mut stats.inner_stats, config, instruction);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -0,0 +1,12 @@
|
|||||||
|
[package]
|
||||||
|
name = "klondike-bench"
|
||||||
|
version = "0.1.0"
|
||||||
|
edition = "2024"
|
||||||
|
|
||||||
|
[dependencies]
|
||||||
|
card_game.workspace = true
|
||||||
|
klondike.workspace = true
|
||||||
|
rand = { version = "0.10.1", default-features = false }
|
||||||
|
|
||||||
|
[lints]
|
||||||
|
workspace = true
|
||||||
@@ -0,0 +1,46 @@
|
|||||||
|
use card_game::Game;
|
||||||
|
use klondike::{Klondike, KlondikeConfig, KlondikeStats, Rng};
|
||||||
|
|
||||||
|
const MAX_MOVES: usize = 250;
|
||||||
|
|
||||||
|
fn play_to_win(rng: &mut Rng) -> Option<KlondikeStats> {
|
||||||
|
// create game session
|
||||||
|
let mut game = Klondike::with_rng(rng);
|
||||||
|
let mut stats = KlondikeStats::new();
|
||||||
|
const CONFIG: KlondikeConfig = KlondikeConfig {
|
||||||
|
draw_stock: klondike::DrawStockConfig::DrawOne,
|
||||||
|
};
|
||||||
|
// play game a bit
|
||||||
|
while let Some(instruction) = game.get_auto_move()
|
||||||
|
&& !game.is_win()
|
||||||
|
{
|
||||||
|
// quit before 250 moves
|
||||||
|
if MAX_MOVES < stats.moves() + 1 {
|
||||||
|
return None;
|
||||||
|
}
|
||||||
|
|
||||||
|
game.process_instruction(&mut stats, &CONFIG, instruction);
|
||||||
|
}
|
||||||
|
game.is_win().then_some(stats)
|
||||||
|
}
|
||||||
|
fn main() {
|
||||||
|
use rand::SeedableRng;
|
||||||
|
let mut rng = Rng::seed_from_u64(0);
|
||||||
|
const GAMES: u32 = 1000;
|
||||||
|
let mut wins = 0;
|
||||||
|
let mut score_tally = [0usize; MAX_MOVES * 10 / 5];
|
||||||
|
let mut recycle_tally = [0usize; MAX_MOVES];
|
||||||
|
let mut moves_tally = [0usize; MAX_MOVES];
|
||||||
|
for _ in 0..GAMES {
|
||||||
|
if let Some(stats) = play_to_win(&mut rng) {
|
||||||
|
wins += 1;
|
||||||
|
score_tally[stats.score() / 5] += 1;
|
||||||
|
recycle_tally[stats.recycle_count()] += 1;
|
||||||
|
moves_tally[stats.moves()] += 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
println!("score_tally={score_tally:?}");
|
||||||
|
println!("recycle_tally={recycle_tally:?}");
|
||||||
|
println!("moves_tally={moves_tally:?}");
|
||||||
|
println!("wins = {wins}/{GAMES} win_rate = {}%", wins * 100 / GAMES);
|
||||||
|
}
|
||||||
@@ -7,3 +7,6 @@ edition = "2024"
|
|||||||
card_game.workspace = true
|
card_game.workspace = true
|
||||||
klondike.workspace = true
|
klondike.workspace = true
|
||||||
rand = { version = "0.10.1", default-features = false, features = ["thread_rng"] }
|
rand = { version = "0.10.1", default-features = false, features = ["thread_rng"] }
|
||||||
|
|
||||||
|
[lints]
|
||||||
|
workspace = true
|
||||||
|
|||||||
@@ -4,8 +4,8 @@ use klondike::{
|
|||||||
KlondikePile, KlondikePileStack, KlondikeStats, SkipCards, Tableau, TableauStack,
|
KlondikePile, KlondikePileStack, KlondikeStats, SkipCards, Tableau, TableauStack,
|
||||||
};
|
};
|
||||||
|
|
||||||
// #[cfg(test)]
|
#[cfg(test)]
|
||||||
// mod test;
|
mod test;
|
||||||
|
|
||||||
use std::fmt::Display;
|
use std::fmt::Display;
|
||||||
struct Displayed<T>(T);
|
struct Displayed<T>(T);
|
||||||
|
|||||||
@@ -1,33 +1,15 @@
|
|||||||
use klondike::Klondike;
|
|
||||||
use card_game::Session;
|
use card_game::Session;
|
||||||
|
use klondike::Klondike;
|
||||||
#[test]
|
#[test]
|
||||||
fn test_is_winnable() {
|
fn test_is_winnable() {
|
||||||
// is winnable
|
// is winnable
|
||||||
let is_winnable = Session::new_default(Klondike::with_seed(123)).is_winnable();
|
let is_winnable = Session::new_default(Klondike::with_seed(0)).is_winnable().unwrap();
|
||||||
println!("is_winnable = {is_winnable:?}");
|
if let Some(win_moves) = is_winnable {
|
||||||
}
|
// for (i, ins) in win_moves.into_iter().enumerate() {
|
||||||
#[test]
|
// println!("{i} = {:?}", ins.instruction());
|
||||||
fn test_klondike() {
|
// }
|
||||||
// create game session
|
println!("Game is winnable with {} moves", win_moves.len());
|
||||||
let game = Klondike::with_seed(123);
|
} else {
|
||||||
let mut session = Session::new_default(game);
|
println!("Game is not winnable");
|
||||||
|
|
||||||
// is winnable
|
|
||||||
let is_winnable = session.is_winnable();
|
|
||||||
println!("is_winnable = {is_winnable:?}");
|
|
||||||
|
|
||||||
// play game
|
|
||||||
while let Some(instruction) = session.possible_instructions().next() {
|
|
||||||
session.process_instruction(instruction);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// did win
|
|
||||||
let is_win = session.is_win();
|
|
||||||
|
|
||||||
// print session history
|
|
||||||
for (i, instruction) in session.history().iter().enumerate() {
|
|
||||||
println!("move {i} = {instruction:?}");
|
|
||||||
}
|
|
||||||
|
|
||||||
println!("is_win = {is_win}");
|
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -6,3 +6,6 @@ edition = "2024"
|
|||||||
[dependencies]
|
[dependencies]
|
||||||
card_game.workspace = true
|
card_game.workspace = true
|
||||||
rand = { version = "0.10.1", default-features = false, features = ["std_rng"] }
|
rand = { version = "0.10.1", default-features = false, features = ["std_rng"] }
|
||||||
|
|
||||||
|
[lints]
|
||||||
|
workspace = true
|
||||||
|
|||||||
+1
-1
@@ -6,7 +6,7 @@ Klondike
|
|||||||
## Example
|
## Example
|
||||||
|
|
||||||
```rust
|
```rust
|
||||||
use card_game::{Session, Game};
|
use card_game::Session;
|
||||||
use klondike::Klondike;
|
use klondike::Klondike;
|
||||||
|
|
||||||
// create game session
|
// create game session
|
||||||
|
|||||||
@@ -533,6 +533,10 @@ impl Iterator for KlondikeIter {
|
|||||||
instruction
|
instruction
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
#[test]
|
||||||
|
fn test_klondike_iter() {
|
||||||
|
assert_eq!(KlondikeIter::new().count(), 721);
|
||||||
|
}
|
||||||
|
|
||||||
#[derive(Clone, Debug, Eq, Hash, PartialEq)]
|
#[derive(Clone, Debug, Eq, Hash, PartialEq)]
|
||||||
pub struct Klondike {
|
pub struct Klondike {
|
||||||
|
|||||||
Reference in New Issue
Block a user