"David Merrick" wrote
class BJ_Player(BJ_Hand):
""" A Blackjack Player. """
def betting(stash):
You forgot self so stash will take on the value of
the instance.
try:
if stash > 0:
wager = int(input("\nHow much do you want to wager?:
"))
Hi Stefan, Alan,
Thanks for your useful advice. The first thing I will try is take the call to
the spssio dll out of the Python method (ie, 'unwrap' it) and put it inside the
loop. I didn't think wrapping the code inside a method/function would create so
much overhead.
Cheers!!
Albert-Jan
I know a way to do that
set1 = set(list1)
set2 = set(list2)
combined = set1&set2
On Sat, Jul 2, 2011 at 5:16 PM, Walter Prins wrote:
> Hi Ankur,
>
> On 2 July 2011 21:30, ANKUR AGGARWAL wrote:
>
>> Hey
>> I am looking for an algo for the largest sequence search in the two list.
>>
>> Example :
Hi,
Are you looking for a Longest Common Subsequence (LCS) algorithm?
http://code.activestate.com/recipes/576869-longest-common-subsequence-problem-solver/
Cheers!!
Albert-Jan
~~
All right, but apart from the sanitation, the
HI. I feel I'm starting to go round in circles solving this problem. I feel
I made significant progress.
Can someone help me iron out the bugs please
# Blackjack
# From 1 to 7 players compete against a dealer
import cards, games
class BJ_Card(cards.Card):
""" A Blackjack Card. """
ACE_VA
"David Merrick" wrote
I feel I'm starting to go round in circles solving this problem.
I feel I made significant progress.
That sounds like a contradiction.
Did you make progress or are you going in circles?
Do you understand what self is?
File "I:/Python/Python Source Code/chapter09/black
