Generate Chess960 starting position: Difference between revisions

{{task}} [[Category:Chess960]]

The purpose of this task is to write a program that can randomly generate any one of the 960 Chess960 initial positions. You will show the result as the first rank displayed withusing either the [[wp:Chess symbols in Unicode|Chesschess symbols in Unicode: (♔♕♖♗♘)]] or with, the letters '''K'''ing '''Q'''ueen '''R'''ook '''B'''ishop k'''N'''ight, or the corresponding letters in a language other than English.

<langsyntaxhighlight lang="11l">F random960()

print(random960())</langsyntaxhighlight>

<langsyntaxhighlight AutoHotkeylang="autohotkey">Loop, 5

}</langsyntaxhighlight>

<langsyntaxhighlight lang="befunge">#.#.#.#.065*0#v_1-\>>?1v

>$\>,1+ :7`#@_^> v960v <</langsyntaxhighlight>

<langsyntaxhighlight Clang="c">#include<stdlib.h>

<langsyntaxhighlight lang="cpp">#include <iostream>

<langsyntaxhighlight lang="clojure">(ns c960.core

;; => ("♘, ♖, ♔, ♘, ♗, ♗, ♖, ♕" "♗, ♖, ♔, ♘, ♘, ♕, ♖, ♗" "♘, ♕, ♗, ♖, ♔, ♗, ♘, ♖" "♖, ♔, ♘, ♘, ♕, ♖, ♗, ♗")</langsyntaxhighlight>

<langsyntaxhighlight lang="d">void main() {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="d">void main() {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="d">void main() {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="lisp">(define-values (K Q R B N) (iota 5))

<langsyntaxhighlight lang="elixir">defmodule Chess960 do

Enum.each(1..5, fn _ -> IO.puts Chess960.shuffle end)</langsyntaxhighlight>

<langsyntaxhighlight lang="elixir">defmodule Chess960 do

Enum.each(1..5, fn _ -> IO.puts Chess960.construct end)</langsyntaxhighlight>

<langsyntaxhighlight lang="elixir">defmodule Chess960 do

Enum.each(1..5, fn _ -> IO.puts Chess960.start_position end)</langsyntaxhighlight>

<langsyntaxhighlight lang="factor">USING: io kernel math random sequences ;

MAIN: chess960-demo</langsyntaxhighlight>

<langsyntaxhighlight lang="factor">USING: chess960 prettyprint ;

chess960-position .</langsyntaxhighlight>

<langsyntaxhighlight lang="forth">\ make starting position for Chess960, constructive

960 choose chess960 \ random position</langsyntaxhighlight>

<langsyntaxhighlight lang="fortran">program chess960

<langsyntaxhighlight lang="go">package main

}</langsyntaxhighlight>

<langsyntaxhighlight Haskelllang="haskell">import Data.List

. filter isChess960 $ permutations [R,N,B,Q,K,B,N,R]</langsyntaxhighlight>

BuildThe simplest J approach for this task is to initially build a table of the starting positions. thenThen, for the task, we pick one position from the table at random. There are 40320 distinct permutations of 8 items and 5040 distinct permutations of these chess pieces and (as the task name points out) only 960 permutations which also satisfy the constraints on bishop and rook position, so little memory is needed to generate the table. Also, since the table is built at "compile time", execution is fast (though "compilation" is reasonably fast also).

<langsyntaxhighlight Jlang="j">row0=: u: 9812+2}.5|i.10

gen=: valid {~ ? bind 960</langsyntaxhighlight>

<langsyntaxhighlight Jlang="j"> gen''

♖♔♕♗♗♘♖♘</langsyntaxhighlight>

<langsyntaxhighlight lang="java5">import java.util.Arrays;

}</langsyntaxhighlight>

<langsyntaxhighlight javaScriptlang="javascript">function ch960startPos() {

for (var x = 1; x <= 10; x++) console.log(ch960startPos().join(" | "));</langsyntaxhighlight>

<langsyntaxhighlight lang="julia">function generateposition()

@show generateposition()</langsyntaxhighlight>

<langsyntaxhighlight lang="scala">object Chess960 : Iterable<String> {

}</langsyntaxhighlight>

<langsyntaxhighlight Lualang="lua">-- Insert 'str' into 't' at a random position from 'left' to 'right'

print(table.concat(chess960()))</langsyntaxhighlight>

<langsyntaxhighlight Mathematicalang="mathematica">Print[StringJoin[

OddQ[Subtract @@ Flatten[Position[#, "\[WhiteBishop]"]]] &]]]];</langsyntaxhighlight>

<langsyntaxhighlight MiniScriptlang="miniscript">// placeholder knights

print join(rank, " ")</langsyntaxhighlight>

<langsyntaxhighlight Nimlang="nim">import random, strutils

echo row.join(" ")</langsyntaxhighlight>

<langsyntaxhighlight lang="objeck">class Chess960 {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="parigp">chess960() =

}</langsyntaxhighlight>

<langsyntaxhighlight lang="perl">sub rnd($) { int(rand(shift)) }

print "@{[chess960]}\n" for 0 .. 10;</langsyntaxhighlight>

-- end if setd(s,0,d)</span>

<langsyntaxhighlight PicoLisplang="picolisp">(load "@lib/simul.l")

(bye)</langsyntaxhighlight>

<langsyntaxhighlight PowerShelllang="powershell">function Get-RandomChess960Start

<langsyntaxhighlight lang="python">>>> from itertools import permutations

>>></langsyntaxhighlight>

<langsyntaxhighlight lang="python">>>> import re

>>></langsyntaxhighlight>

<langsyntaxhighlight lang="python">from random import choice

print(random960())</langsyntaxhighlight>

<langsyntaxhighlight lang="python">from random import choice

print(''.join(choice(gen)))</langsyntaxhighlight>

<langsyntaxhighlight lang="rsplus">

<langsyntaxhighlight lang="racket">#lang racket

(chess960-start-position)</langsyntaxhighlight>

<syntaxhighlight lang="raku" perl6line>repeat until m/ '♗' [..]* '♗' / { $_ = < ♖ ♖ ♖ ♕ ♗ ♗ ♘ ♘ >.pick(*).join }

say .comb;</langsyntaxhighlight>

<syntaxhighlight lang="raku" perl6line>sub chess960 {

say chess960;</langsyntaxhighlight>

<syntaxhighlight lang="raku" perl6line>constant chess960 =

.say for chess960;</langsyntaxhighlight>

<syntaxhighlight lang="raku" perl6line>constant chess960 = gather for 0..3 -> $q {

say chess960.pick;</langsyntaxhighlight>

=== FromRaku: StartingGenerate Positionfrom SP-ID Number (SPID) ===

<syntaxhighlight lang="raku" perl6line>subset Pos960 of Int where { $_ ~~ ^960 };

say chess960; # (it happened to pick #300)</langsyntaxhighlight>

<langsyntaxhighlight lang="rexx">/*REXX program generates a random starting position for the Chess960 game. */

say translate(translate(_, 'q', .)) /*stick a fork in it, we're all done. */</langsyntaxhighlight>

<langsyntaxhighlight lang="rexx">/*REXX program generates all random starting positions for the Chess960 game. */

/*stick a fork in it, we're all done. */ /**/</langsyntaxhighlight>

<langsyntaxhighlight lang="rexx">/*---------------------------------------------------------------

Return</langsyntaxhighlight>

<langsyntaxhighlight lang="ruby">pieces = %i(♔ ♕ ♘ ♘ ♗ ♗ ♖ ♖)

puts row</langsyntaxhighlight>

<langsyntaxhighlight lang="ruby">row = [:♖, :♔, :♖]

puts row</langsyntaxhighlight>

<langsyntaxhighlight lang="ruby">KRN = %w(NNRKR NRNKR NRKNR NRKRN RNNKR RNKNR RNKRN RKNNR RKNRN RKRNN)

5.times {puts chess960}</langsyntaxhighlight>

<langsyntaxhighlight lang="rust">use std::collections::BTreeSet;

}</langsyntaxhighlight>

<langsyntaxhighlight Scalalang="scala">import scala.annotation.tailrec

}</langsyntaxhighlight>

<langsyntaxhighlight lang="scala">object Chess960 extends App {

}</langsyntaxhighlight>

<langsyntaxhighlight Schemelang="scheme">(import (scheme base) (scheme write)

<langsyntaxhighlight lang="seed7">$ include "seed7_05.s7i";

end func;</langsyntaxhighlight>

<langsyntaxhighlight lang="ruby">func is_valid_960 (backrank) {

say random_960_position().join(' ')</langsyntaxhighlight>

<langsyntaxhighlight lang="tcl">package require struct::list

foreach - {1 2 3 4 5} {puts [chessRender [chess960]]}</langsyntaxhighlight>

<langsyntaxhighlight ecmascriptlang="wren">import "random" for Random

import "./dynamic" for Tuple

import "./fmt" for Fmt

for (i in 0..4) System.print(chess960.call(W, rand.int(960)))</langsyntaxhighlight>

=={{header|YabasicXPL0}}==

<langsyntaxhighlight lang="zkl">const pieces="KQRrBbNN";

}).pump(List,"concat","toUpper"):Utils.Helpers.listUnique(_);</langsyntaxhighlight>

<langsyntaxhighlight lang="zkl">N:=starts.len(); println(N);

do(10){ starts[(0).random(N)].apply(glyphs.find).println() }</langsyntaxhighlight>