riichi/src/riichi.erl

167 lines
5 KiB
Erlang
Raw Normal View History

%% @author Correl Roush <correl@gmail.com>
%%
%% @doc Riichi Mahjong library.
2012-08-01 04:11:36 +00:00
%%
%% @headerfile "../include/riichi.hrl"
2012-05-04 12:18:08 +00:00
-module(riichi).
-include("../include/riichi.hrl").
2012-05-04 12:18:08 +00:00
-export([
is_valid_tile/1,
2012-08-15 01:25:51 +00:00
is_open/1,
dora/1,
nearest/2,
score/3,
score_hand/1,
score_hand/2,
score_hand/3,
shuffle/1,
tiles/0
2012-05-04 12:18:08 +00:00
]).
-spec is_valid_tile(tile()) -> boolean().
2012-05-04 12:18:08 +00:00
is_valid_tile(#tile{suit=dragon, value=Value}) ->
lists:member(Value, [white, green, red]);
is_valid_tile(#tile{suit=wind, value=Value}) ->
lists:member(Value, [east, south, west, north]);
is_valid_tile(#tile{suit=Suit, value=Value}) ->
ValidSuit = lists:member(Suit, [pin, sou, man]),
ValidValue = is_integer(Value) and (Value > 0) and (Value < 10),
ValidSuit and ValidValue;
is_valid_tile(_) ->
false.
2012-08-15 01:25:51 +00:00
-spec is_open(hand() | meld() | tile()) -> boolean().
is_open(#tile{from=draw}) ->
false;
is_open(#tile{}) ->
true;
is_open(#meld{tiles=Tiles}) ->
lists:any(fun is_open/1, Tiles);
is_open(#hand{tiles=Tiles, melds=Melds}) ->
lists:any(fun is_open/1, Tiles)
orelse lists:any(fun is_open/1, Melds).
-spec dora(tile()) -> tile().
2012-05-04 12:18:08 +00:00
dora(#tile{suit=dragon, value=Value}=Indicator) ->
case Value of
white -> Indicator#tile{value=green};
green -> Indicator#tile{value=red};
red -> Indicator#tile{value=white}
end;
dora(#tile{suit=wind, value=Value}=Indicator) ->
case Value of
east -> Indicator#tile{value=south};
south -> Indicator#tile{value=west};
west -> Indicator#tile{value=north};
north -> Indicator#tile{value=east}
end;
dora(#tile{value=Value}=Indicator) ->
case is_valid_tile(Indicator) of
false ->
throw({error, invalid_tile});
_ ->
if
Value == 9 -> Indicator#tile{value=1};
true -> Indicator#tile{value=Value + 1}
end
end.
-spec nearest(integer(), integer()) -> integer().
2012-05-04 12:18:08 +00:00
nearest(Num, To) when Num rem To == 0 ->
Num;
nearest(Num, To) ->
Num - (Num rem To) + To.
-spec score(integer(), integer(), boolean()) -> integer().
2012-05-04 17:49:13 +00:00
score(_Fu, Han, Limit) when (Han >= 5) and (Limit == true) ->
2012-05-04 12:18:08 +00:00
if
2012-05-04 17:49:13 +00:00
Han < 6 ->
2012-05-04 12:18:08 +00:00
2000;
2012-05-04 17:49:13 +00:00
Han < 8 ->
2012-05-04 12:18:08 +00:00
3000;
2012-05-04 17:49:13 +00:00
Han < 11 ->
2012-05-04 12:18:08 +00:00
4000;
2012-05-08 04:45:41 +00:00
Han < 13 ->
2012-05-04 12:18:08 +00:00
6000;
true ->
8000
end;
2012-05-04 17:49:13 +00:00
score(Fu, Han, Limit) ->
Score = nearest(Fu * round(math:pow(2, 2 + Han)), 100),
2012-05-04 12:18:08 +00:00
if
Limit and (Score > 2000) ->
2000;
true ->
Score
end.
-spec score_hand(hand()) -> integer().
score_hand(#hand{}=H) ->
score_hand(H, 20).
score_hand(#hand{}=H, Fu) ->
score_hand(H, Fu, true).
-spec score_hand(hand(), integer(), boolean()) -> integer().
2012-05-08 05:16:41 +00:00
score_hand(#hand{}=Hand, BaseFu, Limit) ->
Fu = [
BaseFu
],
2012-05-08 05:16:41 +00:00
Yakuman = [
_DaiSanGen = fun(#hand{}=H) ->
Sets = find_sets(H#hand.tiles),
HasRed = lists:member({3, #tile{suit=dragon, value=red}}, Sets),
HasWhite = lists:member({3, #tile{suit=dragon, value=white}}, Sets),
HasGreen = lists:member({3, #tile{suit=dragon, value=green}}, Sets),
case HasRed and HasWhite and HasGreen of
true -> 13;
_ -> 0
end
2012-05-08 05:06:00 +00:00
end,
2012-05-08 05:27:48 +00:00
_Suu_An_Kou = fun(#hand{}=H) ->
Sets = find_sets(H#hand.tiles),
case 4 == length([C || {C, _T} <- Sets, C == 3]) of
true -> 13;
_ -> 0
end
end,
2012-05-08 14:46:00 +00:00
_Ryuu_Ii_Sou = fun(#hand{}=H) ->
Set = sets:from_list(H#hand.tiles),
Greens = sets:from_list(lists:flatten([
[#tile{suit=sou, value=V} || V <- [2,3,4,6,8]],
[#tile{suit=dragon, value=green}]
])),
case sets:is_subset(Set, Greens) of
true -> 13;
_ -> 0
end
end,
2012-05-08 05:16:41 +00:00
_Kokushi_Musou = fun(#hand{}=H) ->
Sets = find_sets(H#hand.tiles),
Terminals = not lists:any(fun(#tile{value=V}) -> lists:member(V, lists:seq(2,8)) end, H#hand.tiles),
2012-05-08 14:41:32 +00:00
Orphans = 12 == length([C || {C, _T} <- Sets, C == 1]),
2012-05-08 05:16:41 +00:00
case Terminals and Orphans of
true -> 13;
_ -> 0
end
end
],
2012-05-08 14:41:32 +00:00
score(lists:sum(Fu), lists:sum([F(Hand) || F <- Yakuman]), Limit).
-spec find_sets([tile()]) -> [{integer(), tile()}].
find_sets(Tiles) ->
Unique = sets:to_list(sets:from_list(Tiles)),
[{length(lists:filter(fun(X) -> X == T end, Tiles)), T}
|| T <- Unique].
-spec shuffle(list()) -> list().
shuffle(List) ->
[X || {_, X} <- lists:sort([{random:uniform(), I} || I <- List])].
-spec tiles() -> [string()].
tiles() ->
lists:flatten([lists:duplicate(4, T) || T <- ?TILES]).