Word search: Difference between revisions

;Example

 

 

0 n a y r y R e l m f

tar (5,7)(5,5) elm (6,0)(8,0)

max (7,4)(9,4) pup (5,3)(3,5)

<br><br>

 

 

 

 

 

 

{{out}}

<pre>

 

 

 

</pre>

 

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

{{trans|Java}}

using System.Collections.Generic;

using System.Linq;

}

}

 

<pre>

nyu (5,2)(7,4) ape (5,7)(3,7)

era (3,7)(5,9) ere (1,2)(3,0)

</pre>

 

=={{header|D}}==

{{trans|Java}}

import std.stdio;

 

writeln(grid.solutions[size - 1]);

}

 

{{out}}

<br>

The link to "unixdict" appears to be broken so I've used instead the dictionary at "/usr/share/dict/words" which came pre-installed with my Ubuntu 16.04 distribution. I've no idea whether these dictionaries are the same or not.

 

import (

unixDictPath := "/usr/share/dict/words"

printResult(createWordSearch(readWords(unixDictPath)))

 

{{out}}

Implementation:

 

 

unixdict=:verb define

puz=. (_23{.":i.10),' ',1j1#"1(":i.10 1),.' ',.10 10$fill (I.grid=' ')} grid

puz,' ',1 1}._1 _1}.":((</.~ <.) i.@# * 3%#)key

 

Notes:

Example run:

 

0 1 2 3 4 5 6 7 8 9

cop 10 8 nw │ paz 8 10 west │ wan 9 6 west

fizzle 1 6 sw │ penna 1 9 south│

 

=={{header|Java}}==

{{works with|Java|7}}

import static java.lang.String.format;

import java.util.*;

System.out.println(grid.solutions.get(size - 1));

}

 

<pre>Attempts: 2

liz (9,8)(7,8) dam (2,0)(0,2)

via (8,9)(8,7)</pre>

 

=={{header|Julia}}==

Modified from the Go version. The task listed word list is offline, so the Debian distribution file "words.txt" was used instead.

 

const stepdirections = [[1, 0], [0, 1], [1, 1], [1, -1], [-1, 0], [0, -1], [-1, -1], [-1, 1]]

 

printresult(wordmatrix("words.txt", false))

Attempts: 1

Number of words: 25

=={{header|Kotlin}}==

{{trans|Java}}

 

import java.util.Random

fun main(args: Array<String>) {

printResult(createWordSearch(readWords("unixdict.txt")))

 

Sample output:

act (2,0)(0,2)

</pre>

 

use warnings;

use Path::Tiny;

use List::Util qw( shuffle );

}

substr $_, $pos, length $mask,

push @played, join ' ', $word, $start, $end;

tr/.// > 0 or last;

while( /(?=(.(?:$gap.){$nm1}))/g )

{

$pat =~ tr/.// or next;

my $pos = "$-[1] $+[1]";

 

return undef;

{{out}}

<pre>

</pre>

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

{{trans|Java}}

(or at least it started out that way... so more "inspired by")

 

;; ---------------------------------------------------------------------------------------------------

(module+ main

[(hash-has-key? cells (cons r c)) (loop r (add1 c) cells msg)]

[else (loop r (add1 c) (hash-set cells (cons r c) (car msg)) (cdr msg))])))))

 

{{out}}

visit (9,12 ↖) von (3,4 ↗)

way (18,17 ←) wham (11,5 ↓) </pre>

 

=={{header|zkl}}==

Repeat words allowed. Rather brute force as I didn't realize that the message has to fit exactly.

var [const] dirs=T(T(1,0), T(0,1), T(1,1), T(1,-1), T(-1,0),T(0,-1), T(-1,-1), T(-1,1));

vs,v:=List(),List();

foreach r,c in (10,10){ if(grid[r][c]=="?") grid[r][c]=MSG.next() }

MSG._n==msg.len() // use all of, not more, not less, of msg?

 

validWord:=RegExp("[A-Za-z]+\n$").matches;

fcn([(r,c,w)]){ "%-19s".fmt("[%d,%d]: %s ".fmt(r,c,w)) }) }

);

{{out}}

<pre>

102

</pre>