Deal cards for FreeCell: Difference between revisions

{{trans|Python}}

 

[Int] r

-V max_int32 = 7FFF'FFFF

print(‘Hand #.’.format(seed))

V deck = deal(seed)

 

{{out}}

 

=={{header|Ada}}==

procedure FreeCell is

type State is mod 2**31;

New_Line;

Deal(617);

{{out}}

<pre>JD 2D 9H JC 5D 7H 7C 5H

 

=={{header|AutoHotkey}}==

cards := "A23456789TJQK", suits := "♣♦♥♠", card := [], Counter := 0

loop, parse, cards

Seed := Mod(214013 * Seed + 2531011, 2147483648)

return, [Seed, Seed // 65536]

MS() found at http://rosettacode.org/wiki/Linear_congruential_generator#AutoHotkey

Gui, add, edit, w320 r17 -VScroll, % "Game# 1`n" FreeCell(1) "`n`nGame#617`n" FreeCell(617)

Gui, show

GuiEscape:

ExitApp

Outputs:<pre>Game# 1

J♦ 2♦ 9♥ J♣ 5♦ 7♥ 7♣ 5♥

=={{header|BBC BASIC}}==

{{works with|BBC BASIC for Windows}}

hand% = 617

NEXT

ENDIF

{{out}}

[[File:freecell_BBC.gif]]

 

=={{header|Befunge}}==

>4$0" :rebmun emaG">:#,_$&>55+,>"O?+"**2+*"C4'' "**v

>8%!492*+*48*\-,1-:11p0g\0p11g#^_@A23456789TJQKCDHS*

^+3:g11,g2+"/"%4,g2+g14/4:-\"v"g0:%g11+*-/2-10-1*<>+

{{out}}

<pre>Game number: 1

 

=={{header|Bracmat}}==

= array rank ranks suit suits

. A 2 3 4 5 6 7 8 9 T J Q K:?ranks

& put$(deal$(!deck.617),"dealt.txt",APP)

&

Content of <code>dealt.txt</code>:

<pre>Game #1

 

=={{header|C}}==

#include <stdlib.h>

#include <locale.h>

 

return 0;

 

=={{header|C sharp|C#}}==

Longer than it absolutely needs to be because I split out several independently useful classes.

using System.Collections.Generic;

using System.Text;

}

}

{{out}}

<pre>JD 2D 9H JC 5D 7H 7C 5H

===Shorter version===

Shorter than the previous version. Adds a few classes, but stays closer to the gist of the C version.

using System;

using System.Text;

}

}

{{out}}

<pre>Deck 1

 

=={{header|C++}}==

#include <windows.h>

#include <iostream>

}

//--------------------------------------------------------------------------------------------------

Output:

<pre>

This is written using a more object-oriented approach than the version above.

 

#include <iostream> // std::cout

#include <sstream> // std::stringstream

return 0;

}

{{out}}

<pre>Deck 1

 

=={{header|Ceylon}}==

 

//a function that returns a random number generating function

print("\n");

deal(617);

 

=={{header|Clojure}}==

 

(defn lcg [seed]

(reverse (reduce xchg deck (gen seed))))))

 

 

=={{header|Common Lisp}}==

#'(lambda ()

(ash (setf seed (mod (+ (* 214013 seed) 2531011) (expt 2 31))) -16)))

 

(show-deck 1)

 

=={{header|D}}==

{{trans|C}}

 

struct RandomGenerator {

cards.deal(seed);

cards.show;

<pre>Hand 11982

AH AS 4H AC 2D 6S TS JS

{{libheader| System.SysUtils}}

{{Trans|C#}}

program Deal_cards_for_FreeCell;

 

Writeln('Deck 617'#10, Deck.ToString);

readln;

{{out}}

<pre>Deck 1

=={{header|Elixir}}==

{{trans|Ruby}}

import Bitwise

 

System.argv |> Enum.map(&String.to_integer/1)

 

{{out}}

 

=={{header|ERRE}}==

PROGRAM FREECELL

 

SHOW(CARDS%[])

END PROGRAM

{{out}}

<pre>

=={{header|F_sharp|F#}}==

The deal for this one is a little arduous, as we're using a list and maintain an immutable state. Of course, an array could be used, but what's the fun in that?

let msKindaRand seed =

let state = ref seed

 

[1; 617] |> List.iter game

 

{{out}}

 

=={{header|Factor}}==

math.functions namespaces qw sequences sequences.extras ;

IN: rosetta-code.freecell

: freecell ( -- ) 1 617 [ .game ] bi@ ;

 

{{out}}

<pre>

{{works with|Fortran|95 and later}}

Using the lcgs module from [[Linear congruential generator#Fortran]]:

use lcgs

implicit none

call Freecelldeal(617)

{{out}}

<pre>Game #1

 

=={{header|FreeBASIC}}==

' compile with: fbc -s console

 

Print : Print "hit any key to end program"

Sleep

{{out}}

<pre>game #1

=={{header|Go}}==

{{trans|C}}

 

import (

fmt.Printf("\nGame #%d\n", game)

show(deal(game))

{{out}}

<pre>

 

=={{header|Groovy}}==

class FreeCell{

int seed

freecell.dealGame()

freecell.dealGame(617)

 

{{out}}

=={{header|Haskell}}==

{{trans|C}}

import Data.Bits

import Data.List

putStrLn $ "Deal " ++ show s ++ ":"

let cards = deal s

 

Execution:

 

=={{header|Icon}} and {{header|Unicon}}==

freecelldealer(\A[1] | &null) # seed from command line

end

procedure rand_freecell() #: lcrng

return ishift(srand_freecell((214013 * srand_freecell() + 2531011) % 2147483648),-16)

{{out|Sample output for game 1}}

<pre>Hand:

=={{header|J}}==

Paraphrase of [[#C|C]]:

 

srnd=: 3 :'SEED=:{.y,11982'

deal=: |.@(swaps pairs) bind deck

 

{{out|Example use}}

J♦ 2♦ 9♥ J♣ 5♦ 7♥ 7♣ 5♥

K♦ K♣ 9♠ 5♠ A♦ Q♣ K♥ 3♥

4♣ Q♠ 9♣ 9♥ 7♣ 6♥ 2♣ 2♠

4♠ T♠ 2♥ 5♦ J♣ 6♣ J♥ Q♥

 

=={{header|Java}}==

import java.util.Arrays;

 

}

{{out}}

<pre>

=={{header|JavaScript}}==

 

/*

* Microsoft C Run-time-Library-compatible Random Number Generator

return columns.map(render_column).join("");

}

 

=={{header|Julia}}==

{{trans|Lua}}

const suit = split("♣♦♥♠", "")

const deck = Vector{String}()

deal(617)

deal()

Game # 1

J♦ 2♦ 9♥ J♣ 5♦ 7♥ 7♣ 5♥

 

=={{header|Kotlin}}==

 

class Lcg(val a: Long, val c: Long, val m: Long, val d: Long, val s: Long) {

game(1)

game(617)

 

{{out}}

 

=={{header|Logo}}==

make "_lcg_state 0

 

print_deal 617

print "||

{{Out}}

<pre>Game #1

=={{header|Lua}}==

Uses bit32 library added in Lua 5.2.

rank = {"A", "2", "3", "4", "5", "6", "7", "8", "9", "T", "J", "Q", "K"}

suit = {"C", "D", "H", "S"}

 

deal(1)

{{out}}

<pre>Game #1

 

=={{header|Mathematica}} / {{header|Wolfram Language}}==

deal[n_] :=

Module[{last = n, idx,

format[deal_] := Grid[Partition[deal, 8, 8, {1, 4}, Null]];

Print[format[deal[1]]];

{{out}}

<pre>JD 2D 9H JC 5D 7H 7C 5H

=={{header|Nim}}==

{{trans|Python}}

proc randomGenerator(seed: int): iterator: int =

echo "Hand ", seed

let deck = deal seed

Output:

<pre>Hand 11982

=={{header|Objeck}}==

{{trans|C#}}

function : Main(args : String[]) ~ Nil {

Deal(1)->PrintLine();

return "{$value}{$suit}";

}

 

Output:

=={{header|Objective-C}}==

Based on the shorter C# version. Objective-C can use the C code as-is, but this example uses some NS foundation classes. The [http://weblog.bignerdranch.com/398-objective-c-literals-part-1/ latest clang compiler] is assumed with [http://en.wikipedia.org/wiki/Automatic_Reference_Counting ARC] enabled. For the sake of clarity & simplicity, method prototypes have been omitted from @interface sections: they are not necessary if everything is in one file.

 

//--------------------------------------------------------------------

}

return 0;

{{out}}

<pre>Deck 1

=={{header|OCaml}}==

{{trans|C}}

(* since OCaml's built-in int type is at least 31 (note: not 32) bits wide,

and this problem takes mod 2^31, it is just enough if we treat it as

Printf.printf "Deal %d:\n" s;

let cards = deal s in

{{out|Execution}}

<pre>$ ocaml freecell.ml 617

=={{header|PARI/GP}}==

The use of <code>local</code> is critical here, so that <code>nextrand()</code> has access to the current state unaffected by whatever the user may have stored in the variable <code>'state</code>.

nextrand()={

(state=(214013*state+2531011)%2^31)>>16

deck[t]=deck[last]

)

 

=={{header|Perl}}==

 

use strict;

binmode STDOUT, ':encoding(utf-8)';

print "Hand $hand_idx\n";

 

=={{header|Phix}}==

{{trans|ERRE}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #004080;">atom</span> <span style="color: #000000;">seed</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"hand %d\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">game_num</span><span style="color: #0000FF;">})</span>

<span style="color: #000000;">show</span><span style="color: #0000FF;">()</span>

{{out}}

<pre>

 

=={{header|PHP}}==

 

protected $deck = array(

}

 

{{Out}}

<pre>

=={{header|PicoLisp}}==

Using the random generator from [[Linear congruential generator#PicoLisp]]:

 

(de msRand ()

(prin " ^[[" (cadr C) "m" (cddr C) "^[[m" (car C))

(at (0 . 8) (prinl)) )

 

=={{header|PureBasic}}==

Global deckSize

Global Dim cards(#MaxCardNum) ;card with highest index is at the top of deck

Print(#CRLF$ + #CRLF$ + "Press ENTER to exit"): Input()

CloseConsole()

{{out|Sample output}}

<pre>Hand #1

=={{header|Python}}==

{{trans|D}}

 

def randomGenerator(seed=1):

print("Hand {}".format(seed))

deck = deal(seed)

{{out}}

<pre>Hand 11982

 

=={{header|R}}==

## copied from

## http://www.rosettacode.org/wiki/Linear_congruential_generator#R

print(deal, quote = FALSE, na.print = "")

}

{{out}}

<pre>

=={{header|Racket}}==

 

 

(module Linear_congruential_generator racket

(present-deal 1)

(newline)

 

{{out}}

(formerly Perl 6)

{{works with|rakudo|2016.05}}

sub ms-lcg-method($seed = $game-number) { ( 214013 * $seed + 2531011 ) % 2**31 }

 

 

dealgame;

{{out}}

<big><big><pre>Game #1

 

See the &nbsp; ''discussion'' &nbsp; page for support for &nbsp; '''game = ─1''' &nbsp; and &nbsp; '''game= ─2''' &nbsp; &nbsp; &nbsp; (minus one and minus two).

numeric digits 15 /*ensure enough digits for the random #*/

parse arg game cols . /*obtain optional arguments from the CL*/

exit /*stick a fork in it, we're all done. */

/*──────────────────────────────────────────────────────────────────────────────────────*/

'''output''' &nbsp; when using the default game number: &nbsp; <tt> 1 </tt>

<pre>

 

=={{header|Ruby}}==

# No arguments? Pick any of first 32000 games.

begin

deck.each_slice(8) {|row| puts " " + row.join(" ")}

puts

{{out}}

<pre>

 

=={{header|Run BASIC}}==

imageDir$ = DefaultDir$ + "\projects\" + projectDir$ + "\image\" ' directory of deck images

imagePath$ = "../";projectDir$;"/image/" ' path of deck images

if card = 52 then end ' out of cards

next xx

[[File:freeCell.png]]

 

Based on JavaScript.

 

extern crate linear_congruential_generator;

 

}

}

 

=={{header|Scala}}==

 

private val suits = Array("C", "D", "H", "S")

println

deal(617)

 

{{out}}

 

=={{header|Seed7}}==

include "console.s7i";

 

writeln("Hand " <& gameNum);

show(cards);

 

{{out}}

=={{header|Swift}}==

Swift 4.2. Largely based on the Objective-C example.

case clubs = "C", diamonds = "D", hearts = "H", spades = "S"

var description: String {

let d617 = Deck(seed: 617)

print(d617)

 

{{out}}

=={{header|Tcl}}==

{{trans|C}}

upvar 1 ${*r} r

expr {[set r [expr {($r * 214013 + 2531011) & 0x7fffffff}]] >> 16}

set cards [deal $s]

puts "Hand $s"

 

=={{header|UNIX Shell}}==

{{works with|zsh}}

for seed; do

print Game $seed:

done

print

{{out}}

<pre>$ zsh freecell.sh 80388

=={{header|Wren}}==

{{trans|Kotlin}}

construct new(a, c, m, d, s) {

_a = a

 

game.call(1)

 

{{out}}

 

=={{header|XPL0}}==

string 0; \use zero-terminated string convention

int RandState;

Deck(Card):= Deck(Size); \replace dealt card with last card

until Size = 0; \all cards have been dealt

 

Output:

 

=={{header|zkl}}==

 

var seed=1; const RMAX32=(1).shiftLeft(31) - 1;

game(1);

game(617);

{{out}}

<pre>