17 Commits

Author SHA1 Message Date
Quaternions 5d5b982bba fix Cargo.lock 2026-06-08 21:18:02 -07:00
Quaternions 987d8bd0f4 Revert "feat(card_game): add Suit::is_black and Rank::value convenience methods"
This reverts commit 2eaa99e82d.

These functions are not necessary.  Remove their usages which are only used in tests and frankenstein code.
2026-06-08 21:17:41 -07:00
funman300 99b49e629e feat(klondike): add optional serde feature for instruction/pile serialization
Adds serde Serialize/Deserialize derives (behind the `serde` feature flag)
to Tableau, Foundation, KlondikePile, SkipCards, TableauStack,
KlondikePileStack, DstFoundation, DstTableau, and KlondikeInstruction.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-06-08 11:20:39 -07:00
funman300 2eaa99e82d feat(card_game): add Suit::is_black and Rank::value convenience methods 2026-06-08 10:55:05 -07:00
funman300 0cdfa5446a feat(card_game): add optional serde feature for Deck, Suit, Rank, Card
Adds a `serde` Cargo feature that gates #[derive(Serialize, Deserialize)]
on the four primitive types: Deck, Suit, Rank, and Card.

- Deck / Suit / Rank: plain enum derives — serialize as variant name strings
- Card: newtype over NonZeroU8 with #[serde(transparent)], serializes as
  the raw packed byte (deck<<6 | suit<<4 | rank)

Without the feature the crate remains no_std-compatible and pulls no
additional dependencies. With it, serde 1.x (derive only, no std) is
added as an optional dep.

Downstream consumers enable with:
  card_game = { ..., features = ["serde"] }
2026-06-08 10:49:53 -07:00
Quaternions ccfcfd6ad3 fix clippy 1.96 lints 2026-05-29 17:43:04 -07:00
Quaternions 156bc8f9b2 card_game without Session is no_std 2026-05-29 17:14:57 -07:00
Quaternions f2f9085aaf use exhaustive match 2026-05-29 17:08:57 -07:00
Quaternions 0e2284e913 fmt 2026-05-29 17:05:27 -07:00
Quaternions 90e1a03962 add NUM_RANKS constant 2026-05-29 16:37:04 -07:00
Quaternions 44b5aa02b8 rename functions 2026-05-29 16:32:39 -07:00
Quaternions ef0936bee9 write more specific functions instead of using generics 2026-05-29 16:30:13 -07:00
Quaternions baab7cd220 add link to readme 2026-05-29 16:16:16 -07:00
Quaternions f4c4e350eb klondike v0.3.0 bump for solver 2026-05-29 14:54:18 -07:00
Quaternions fa098f0d86 card_game v0.4.0 solver 2026-05-29 14:52:58 -07:00
Quaternions 9a4f7e603a write G::Score 2026-05-29 14:47:59 -07:00
Quaternions e43041711a rename state to session 2026-05-29 14:41:57 -07:00
8 changed files with 87 additions and 52 deletions
Generated
+5 -2
View File
@@ -22,9 +22,10 @@ checksum = "c4512299f36f043ab09a583e57bceb5a5aab7a73db1805848e8fef3c9e8c78b3"
[[package]] [[package]]
name = "card_game" name = "card_game"
version = "0.3.0" version = "0.4.0"
dependencies = [ dependencies = [
"arrayvec", "arrayvec",
"serde",
] ]
[[package]] [[package]]
@@ -126,10 +127,11 @@ checksum = "8f42a60cbdf9a97f5d2305f08a87dc4e09308d1276d28c869c684d7777685682"
[[package]] [[package]]
name = "klondike" name = "klondike"
version = "0.2.0" version = "0.3.0"
dependencies = [ dependencies = [
"card_game", "card_game",
"rand", "rand",
"serde",
] ]
[[package]] [[package]]
@@ -238,6 +240,7 @@ source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e" checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e"
dependencies = [ dependencies = [
"serde_core", "serde_core",
"serde_derive",
] ]
[[package]] [[package]]
+2 -2
View File
@@ -8,8 +8,8 @@ members = [
resolver = "3" resolver = "3"
[workspace.dependencies] [workspace.dependencies]
card_game = { version = "0.3.0", path = "card_game", registry = "Quaternions" } card_game = { version = "0.4.0", path = "card_game", registry = "Quaternions" }
klondike = { version = "0.2.0", path = "klondike", registry = "Quaternions" } klondike = { version = "0.3.0", path = "klondike", registry = "Quaternions" }
[workspace.lints.rust] [workspace.lints.rust]
# unsafe_code = "forbid" # unsafe_code = "forbid"
Symlink
+1
View File
@@ -0,0 +1 @@
card_game/README.md
+5 -1
View File
@@ -1,6 +1,6 @@
[package] [package]
name = "card_game" name = "card_game"
version = "0.3.0" version = "0.4.0"
edition = "2024" edition = "2024"
repository = "https://git.aleshym.co/Quaternions/card_game" repository = "https://git.aleshym.co/Quaternions/card_game"
license = "MIT OR Apache-2.0" license = "MIT OR Apache-2.0"
@@ -8,8 +8,12 @@ description = "Card game library."
authors = ["Rhys Lloyd <krakow20@gmail.com>"] authors = ["Rhys Lloyd <krakow20@gmail.com>"]
keywords = ["card", "cards", "solitaire", "klondike"] keywords = ["card", "cards", "solitaire", "klondike"]
[features]
serde = ["dep:serde"]
[dependencies] [dependencies]
arrayvec = { version = "0.7.6", registry = "Quaternions", features = ["len_u8"], default-features = false } arrayvec = { version = "0.7.6", registry = "Quaternions", features = ["len_u8"], default-features = false }
serde = { version = "1", optional = true, default-features = false, features = ["derive"] }
[lints] [lints]
workspace = true workspace = true
+17 -12
View File
@@ -28,6 +28,7 @@ pub trait Game: Clone {
/// card_game supports up to 4 identifiably separate decks. /// card_game supports up to 4 identifiably separate decks.
#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)] #[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Deck { pub enum Deck {
Deck1 = 0b00, Deck1 = 0b00,
Deck2 = 0b01, Deck2 = 0b01,
@@ -48,6 +49,7 @@ impl Deck {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)] #[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Suit { pub enum Suit {
Spades = 0b00, Spades = 0b00,
Hearts = 0b01, Hearts = 0b01,
@@ -77,6 +79,7 @@ impl Suit {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)] #[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Rank { pub enum Rank {
Ace = 1, Ace = 1,
Two = 2, Two = 2,
@@ -146,6 +149,8 @@ impl Rank {
/// 2 bits for suit ID /// 2 bits for suit ID
/// 4 bits for card Value /// 4 bits for card Value
#[derive(Clone, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[cfg_attr(feature = "serde", serde(transparent))]
pub struct Card(core::num::NonZeroU8); pub struct Card(core::num::NonZeroU8);
impl Card { impl Card {
pub const fn new(deck: Deck, suit: Suit, rank: Rank) -> Self { pub const fn new(deck: Deck, suit: Suit, rank: Rank) -> Self {
@@ -317,12 +322,12 @@ pub enum SolveError {
MovesBudgetExceeded, MovesBudgetExceeded,
StatesBudgetExceeded, StatesBudgetExceeded,
} }
impl std::fmt::Display for SolveError { impl core::fmt::Display for SolveError {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
write!(f, "{self:?}") write!(f, "{self:?}")
} }
} }
impl std::error::Error for SolveError {} impl core::error::Error for SolveError {}
/// The solution tends to be very large with long chains of moves that go back to the same state. /// The solution tends to be very large with long chains of moves that go back to the same state.
/// It is recommended to call .clean_solution() if the solution is actually going to be shown to a user. /// It is recommended to call .clean_solution() if the solution is actually going to be shown to a user.
@@ -498,9 +503,9 @@ where
/// Attempt to produce a solution. /// Attempt to produce a solution.
pub fn solve(&self) -> Result<Option<Solution<G>>, SolveError> { pub fn solve(&self) -> Result<Option<Solution<G>>, SolveError> {
let mut state_moves = std::collections::HashMap::new(); let mut state_moves = std::collections::HashMap::new();
let mut state = self.clone(); let mut session = self.clone();
let mut moves = 0; let mut moves = 0;
while !state.is_win() { while !session.is_win() {
moves += 1; moves += 1;
if self.config.solve_moves_budget < moves { if self.config.solve_moves_budget < moves {
return Err(SolveError::MovesBudgetExceeded); return Err(SolveError::MovesBudgetExceeded);
@@ -510,9 +515,9 @@ where
} }
// Continue existing iterator if it exists // Continue existing iterator if it exists
let it = state_moves let it = state_moves
.entry(state.state().state().clone()) .entry(session.state().state().clone())
.or_insert_with(|| { .or_insert_with(|| {
state session
.state() .state()
.state() .state()
.possible_instructions(&self.config().inner) .possible_instructions(&self.config().inner)
@@ -520,19 +525,19 @@ where
// Run one possible move // Run one possible move
if let Some(instruction) = it.next() { if let Some(instruction) = it.next() {
state.process_instruction(instruction); session.process_instruction(instruction);
continue; continue;
} }
// No more moves. If we can't undo we're done // No more moves. If we can't undo we're done
if state.history().is_empty() { if session.history().is_empty() {
return Ok(None); return Ok(None);
} else { } else {
state.undo(); session.undo();
} }
} }
Ok(Some(Solution { Ok(Some(Solution {
solution: state.state.history, solution: session.state.history,
})) }))
} }
} }
@@ -540,7 +545,7 @@ impl<G: Game<Score = i32>> Game for SessionState<G>
where where
G::Stats: Default, G::Stats: Default,
{ {
type Score = i32; type Score = G::Score;
type Stats = SessionStats<G::Stats>; type Stats = SessionStats<G::Stats>;
type Config = SessionConfig<G::Config>; type Config = SessionConfig<G::Config>;
type Instruction = SessionInstruction<G::Instruction>; type Instruction = SessionInstruction<G::Instruction>;
+2 -2
View File
@@ -117,7 +117,7 @@ impl Display for DisplayStats<'_> {
self.0.stats().stats().recycle_count(), self.0.stats().stats().recycle_count(),
self.0.stats().stats().moves(), self.0.stats().stats().moves(),
self.0.stats().undos(), self.0.stats().undos(),
self.0.state().score(self.0.stats(), &self.0.config()), self.0.state().score(self.0.stats(), self.0.config()),
) )
} }
} }
@@ -239,7 +239,7 @@ fn main() -> Result<(), std::io::Error> {
use rand::RngExt; use rand::RngExt;
let mut rng = rand::rng(); let mut rng = rand::rng();
// seed from cli argument // seed from cli argument
let mut seed = if let Some(seed) = std::env::args().skip(1).next() { let mut seed = if let Some(seed) = std::env::args().nth(1) {
seed.parse().expect("Invalid u64 seed") seed.parse().expect("Invalid u64 seed")
} else { } else {
rng.random() rng.random()
+5 -1
View File
@@ -1,11 +1,15 @@
[package] [package]
name = "klondike" name = "klondike"
version = "0.2.0" version = "0.3.0"
edition = "2024" edition = "2024"
[features]
serde = ["dep:serde"]
[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"] }
serde = { version = "1", optional = true, default-features = false, features = ["derive"] }
[lints] [lints]
workspace = true workspace = true
+50 -32
View File
@@ -121,6 +121,7 @@ impl KlondikeStats {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Tableau { pub enum Tableau {
Tableau1, Tableau1,
Tableau2, Tableau2,
@@ -147,6 +148,7 @@ impl Tableau {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Foundation { pub enum Foundation {
Foundation1, Foundation1,
Foundation2, Foundation2,
@@ -167,6 +169,7 @@ impl Foundation {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum KlondikePile { pub enum KlondikePile {
Tableau(Tableau), Tableau(Tableau),
Stock, Stock,
@@ -200,6 +203,7 @@ impl From<Foundation> for KlondikePile {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum SkipCards { pub enum SkipCards {
Skip0, Skip0,
Skip1, Skip1,
@@ -238,6 +242,7 @@ impl SkipCards {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct TableauStack { pub struct TableauStack {
pub tableau: Tableau, pub tableau: Tableau,
pub skip_cards: SkipCards, pub skip_cards: SkipCards,
@@ -271,6 +276,7 @@ impl TableauStack {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum KlondikePileStack { pub enum KlondikePileStack {
Tableau(TableauStack), Tableau(TableauStack),
Stock, Stock,
@@ -294,6 +300,7 @@ impl KlondikePileStack {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct DstFoundation { pub struct DstFoundation {
pub src: KlondikePile, pub src: KlondikePile,
pub foundation: Foundation, pub foundation: Foundation,
@@ -317,6 +324,7 @@ impl DstFoundation {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct DstTableau { pub struct DstTableau {
pub src: KlondikePileStack, pub src: KlondikePileStack,
pub tableau: Tableau, pub tableau: Tableau,
@@ -340,6 +348,7 @@ impl DstTableau {
} }
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum KlondikeInstruction { pub enum KlondikeInstruction {
DstFoundation(DstFoundation), DstFoundation(DstFoundation),
DstTableau(DstTableau), DstTableau(DstTableau),
@@ -377,54 +386,55 @@ const fn sum(n: usize) -> usize {
n * (n + 1) / 2 n * (n + 1) / 2
} }
const STOCK: usize = 52 - sum(TABLEAUS); const STOCK: usize = 52 - sum(TABLEAUS);
const NUM_RANKS: usize = Rank::RANKS.len();
#[derive(Clone, Debug, Eq, Hash, PartialEq)] #[derive(Clone, Debug, Eq, Hash, PartialEq)]
pub struct KlondikeState { pub struct KlondikeState {
stock: Pile<STOCK, STOCK>, stock: Pile<STOCK, STOCK>,
foundations: [Stack<13>; 4], foundations: [Stack<NUM_RANKS>; 4],
tableau1: Pile<0, 13>, tableau1: Pile<0, NUM_RANKS>,
tableau2: Pile<1, 13>, tableau2: Pile<1, NUM_RANKS>,
tableau3: Pile<2, 13>, tableau3: Pile<2, NUM_RANKS>,
tableau4: Pile<3, 13>, tableau4: Pile<3, NUM_RANKS>,
tableau5: Pile<4, 13>, tableau5: Pile<4, NUM_RANKS>,
tableau6: Pile<5, 13>, tableau6: Pile<5, NUM_RANKS>,
tableau7: Pile<6, 13>, tableau7: Pile<6, NUM_RANKS>,
} }
impl KlondikeState { impl KlondikeState {
pub const fn stock(&self) -> &Pile<STOCK, STOCK> { pub const fn stock(&self) -> &Pile<STOCK, STOCK> {
&self.stock &self.stock
} }
pub const fn foundation1(&self) -> &Stack<13> { pub const fn foundation1(&self) -> &Stack<NUM_RANKS> {
&self.foundations[Foundation::Foundation1 as usize] &self.foundations[Foundation::Foundation1 as usize]
} }
pub const fn foundation2(&self) -> &Stack<13> { pub const fn foundation2(&self) -> &Stack<NUM_RANKS> {
&self.foundations[Foundation::Foundation2 as usize] &self.foundations[Foundation::Foundation2 as usize]
} }
pub const fn foundation3(&self) -> &Stack<13> { pub const fn foundation3(&self) -> &Stack<NUM_RANKS> {
&self.foundations[Foundation::Foundation3 as usize] &self.foundations[Foundation::Foundation3 as usize]
} }
pub const fn foundation4(&self) -> &Stack<13> { pub const fn foundation4(&self) -> &Stack<NUM_RANKS> {
&self.foundations[Foundation::Foundation4 as usize] &self.foundations[Foundation::Foundation4 as usize]
} }
pub const fn tableau1(&self) -> &Pile<0, 13> { pub const fn tableau1(&self) -> &Pile<0, NUM_RANKS> {
&self.tableau1 &self.tableau1
} }
pub const fn tableau2(&self) -> &Pile<1, 13> { pub const fn tableau2(&self) -> &Pile<1, NUM_RANKS> {
&self.tableau2 &self.tableau2
} }
pub const fn tableau3(&self) -> &Pile<2, 13> { pub const fn tableau3(&self) -> &Pile<2, NUM_RANKS> {
&self.tableau3 &self.tableau3
} }
pub const fn tableau4(&self) -> &Pile<3, 13> { pub const fn tableau4(&self) -> &Pile<3, NUM_RANKS> {
&self.tableau4 &self.tableau4
} }
pub const fn tableau5(&self) -> &Pile<4, 13> { pub const fn tableau5(&self) -> &Pile<4, NUM_RANKS> {
&self.tableau5 &self.tableau5
} }
pub const fn tableau6(&self) -> &Pile<5, 13> { pub const fn tableau6(&self) -> &Pile<5, NUM_RANKS> {
&self.tableau6 &self.tableau6
} }
pub const fn tableau7(&self) -> &Pile<6, 13> { pub const fn tableau7(&self) -> &Pile<6, NUM_RANKS> {
&self.tableau7 &self.tableau7
} }
pub fn tableau_face_down_cards(&self, tableau: Tableau) -> &[Card] { pub fn tableau_face_down_cards(&self, tableau: Tableau) -> &[Card] {
@@ -461,14 +471,20 @@ impl KlondikeState {
KlondikePileStack::Stock => self.stock.face_up().last(), KlondikePileStack::Stock => self.stock.face_up().last(),
} }
} }
pub fn top_card<S: Into<KlondikePile>>(&self, src: S) -> Option<&Card> { pub fn tableau_top_card(&self, tableau: Tableau) -> Option<&Card> {
match src.into() { self.tableau_face_up_cards(tableau).last()
KlondikePile::Tableau(tableau) => self.tableau_face_up_cards(tableau).last(), }
KlondikePile::Foundation(foundation) => self.foundations[foundation as usize].last(), pub fn foundation_top_card(&self, foundation: Foundation) -> Option<&Card> {
self.foundations[foundation as usize].last()
}
pub fn top_card(&self, pile: KlondikePile) -> Option<&Card> {
match pile {
KlondikePile::Tableau(tableau) => self.tableau_top_card(tableau),
KlondikePile::Foundation(foundation) => self.foundation_top_card(foundation),
KlondikePile::Stock => self.stock.face_up().last(), KlondikePile::Stock => self.stock.face_up().last(),
} }
} }
fn take_stack(&mut self, src: KlondikePileStack) -> (Stack<13>, bool) { fn take_stack_flip_up(&mut self, src: KlondikePileStack) -> (Stack<NUM_RANKS>, bool) {
match src { match src {
KlondikePileStack::Tableau(TableauStack { KlondikePileStack::Tableau(TableauStack {
tableau, tableau,
@@ -489,8 +505,8 @@ impl KlondikeState {
KlondikePileStack::Stock => (Stack::from_iter(self.stock.pop()), false), KlondikePileStack::Stock => (Stack::from_iter(self.stock.pop()), false),
} }
} }
fn take_top_card<S: Into<KlondikePile>>(&mut self, src: S) -> (Option<Card>, bool) { fn take_top_card_flip_up(&mut self, pile: KlondikePile) -> (Option<Card>, bool) {
match src.into() { match pile {
KlondikePile::Tableau(tableau) => match tableau { KlondikePile::Tableau(tableau) => match tableau {
Tableau::Tableau1 => self.tableau1.pop_flip_up(), Tableau::Tableau1 => self.tableau1.pop_flip_up(),
Tableau::Tableau2 => self.tableau2.pop_flip_up(), Tableau::Tableau2 => self.tableau2.pop_flip_up(),
@@ -540,7 +556,7 @@ impl KlondikeState {
KlondikeInstruction::DstFoundation(dst_foundation) => { KlondikeInstruction::DstFoundation(dst_foundation) => {
// get the top cards // get the top cards
if let Some(src_card) = self.top_card(dst_foundation.src) { if let Some(src_card) = self.top_card(dst_foundation.src) {
match self.top_card(dst_foundation.foundation) { match self.foundation_top_card(dst_foundation.foundation) {
// destination card exists // destination card exists
Some(dst_card) => { Some(dst_card) => {
// suit matches? // suit matches?
@@ -564,7 +580,7 @@ impl KlondikeState {
} }
// get the cards // get the cards
if let Some(src_card) = self.stack_bottom_card(dst_tableau.src) { if let Some(src_card) = self.stack_bottom_card(dst_tableau.src) {
match self.top_card(dst_tableau.tableau) { match self.tableau_top_card(dst_tableau.tableau) {
// destination card exists // destination card exists
Some(dst_card) => { Some(dst_card) => {
// red-ness is opposite? // red-ness is opposite?
@@ -624,7 +640,9 @@ impl Klondike {
let mut deck = deck.into_iter(); let mut deck = deck.into_iter();
// generate tableaus // generate tableaus
fn pile<const DN: usize>(deck: &mut <Stack<52> as IntoIterator>::IntoIter) -> Pile<DN, 13> { fn pile<const DN: usize>(
deck: &mut <Stack<52> as IntoIterator>::IntoIter,
) -> Pile<DN, NUM_RANKS> {
let stack = Stack::from_iter(deck.take(DN)); let stack = Stack::from_iter(deck.take(DN));
let mut pile = Pile::new_face_down(stack); let mut pile = Pile::new_face_down(stack);
pile.push(deck.next().unwrap()); pile.push(deck.next().unwrap());
@@ -756,7 +774,7 @@ impl Game for Klondike {
// Move a card from anywhere to a foundation // Move a card from anywhere to a foundation
KlondikeInstruction::DstFoundation(DstFoundation { src, foundation }) => { KlondikeInstruction::DstFoundation(DstFoundation { src, foundation }) => {
stats.increment_move_to_foundation(); stats.increment_move_to_foundation();
let (card, did_flip_up) = self.state.take_top_card(src); let (card, did_flip_up) = self.state.take_top_card_flip_up(src);
if did_flip_up { if did_flip_up {
stats.increment_flip_up_bonus(); stats.increment_flip_up_bonus();
} }
@@ -767,9 +785,9 @@ impl Game for Klondike {
match src { match src {
KlondikePileStack::Stock => stats.increment_move_to_tableau(), KlondikePileStack::Stock => stats.increment_move_to_tableau(),
KlondikePileStack::Foundation(_) => stats.increment_move_from_foundation(), KlondikePileStack::Foundation(_) => stats.increment_move_from_foundation(),
_ => {} KlondikePileStack::Tableau(_) => {}
} }
let (cards, did_flip_up) = self.state.take_stack(src); let (cards, did_flip_up) = self.state.take_stack_flip_up(src);
if did_flip_up { if did_flip_up {
stats.increment_flip_up_bonus(); stats.increment_flip_up_bonus();
} }