lifrordi / DeepStack-Leduc

Example implementation of the DeepStack algorithm for no-limit Leduc poker
https://www.deepstack.ai/
891 stars 211 forks source link

lookahead.ranges_data tensor size #22

Closed DWingHKL closed 6 years ago

DWingHKL commented 6 years ago

I was also confuse about Code comments said it has six dimensional tensor, but lookahead.ranges_data[1] just an five dimensional tensor .look like lose batch dimensional

line 130

--data structures [actions x parent_action x grandparent_id x batch x players x range] self.lookahead.ranges_data[1] = arguments.Tensor(1, 1, 1, constants.players_count, game_settings.card_count):fill(1.0 / game_settings.card_count)

Kiv commented 6 years ago

I also wondered about this.

I think the comment refers to a different version of the code. A batch dimension would allow to store data for different community (public) cards in that same tensor, since the different public cards don't affect the actions available in poker.

lifrordi commented 6 years ago

Yes, the comment is from different version of the code where we had another dimension for batch.