This is about scoring poker hands in general, and just lowest score wins.
leaving out the logic for scoring pair or higher hands, sorting the hand in
ascending order, and then appending all missing card (units 1-13) in ascending
order, lets you use A. (anagram) to score the hand.
A. 9 10 11
3 u: integer should give domain error. Fixed for next beta.
Henry Rich
On 5/10/2021 1:04 PM, greg heil wrote:
bi =: 3&u: NB. lit to int
same=: [
s =: '.1' { ~ [: #: bi NB. bitstrings of y's
s '2 3'
11..1.
1.
11..11
s 2 3
1.
..
NB. Whoops, work around. Wh
bi =: 3&u: NB. lit to int
same=: [
s =: '.1' { ~ [: #: bi NB. bitstrings of y's
s '2 3'
11..1.
1.
11..11
s 2 3
1.
..
NB. Whoops, work around. Where
bq =: (2=3!:0)NB. byte?
bii =: 3 : '(>same`bi {~ bq y)~ y' NB. bytes to ints
si=: '.1' { ~ [: #: b
