Python - Rock Paper Scissors - Include Input User Name and Score Counter -


i'm trying write easy version of rock paper scissors in python 3 elementary-middle school aged kids understand , reproduce.

besides basic game, want incorporate option them input names player1 , player2, using %s program print out. keep getting error in o/p: 

player 1 name: me player 2 name: %s, choose? rock (1), paper (2), or scissors(3)? **traceback (most recent call last):   file "c:/users/xyz/pycharmprojects/rps/scorekeeping.py", line 11, in <module>     print("%s, choose? rock (1), paper (2), or scissors(3)?") % player1 typeerror: unsupported operand type(s) %: 'nonetype' , 'str'**

i'm trying include score counter updates every round (player1 vs player2). resets 0 per round win/tie/lose.

please me see code went wrong. thanks! 

player1 = input("player 1 name: ") player2 = input("player 2 name: ")  while 1:      player1score = 0     player2score = 0      print("%s, choose? rock (1), paper (2), or scissors(3)?") % player1      choice1 = input("> ")      print("%s, choose? rock (1), paper (2), or scissors(3)?") % player2      choice2 = input("> ")      if choice1 == choice2 :         print("its's tie.")     elif choice1 - choice2 == 1 or choice2 - choice1 == 2 :         print("%s wins.") % player1         score1 = score1 + 1     else:         print("%s wins.") % player2         score2 = score2 + 1      print("%s: %d points. %s: %d points.") % (player1, score1, player2, score2)

you're trying format return value of print function. instead, format string you're printing, try:

print("%s, choose? rock (1), paper (2), or scissors(3)?" % player1)

for first statement, example. formatting should occur inside parenthesis.

in order convert input value integer, try:

choice1 = int(input("> "))

currently, you're resetting score 0 @ start of while loop. stop score counters resetting, put the

player1score = 0 player2score = 0

before while loop.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more